Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Eric
Last name:	Angel
DBLP:	29/359
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 28 of 28  

Select a publication
Show	Title	Venue	Rating	Date
	Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. On truthfulness and approximation for scheduling selfish tasks.	J. Scheduling 2009, Volume 12	(0)	2009
	Eric Angel, Evripidis Bampis, Laurent Gourvès. On the minimum hitting set of bundles problem.	Theor. Comput. Sci. 2009, Volume 410	(0)	2009
	Eric Angel, Evripidis Bampis, Laurent Gourvès. On the Minimum Hitting Set of Bundles Problem.	Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings 2008	(0)	2008
	Eric Angel, Evripidis Bampis, Fanny Pascual. An exponential (matching based) neighborhood for the vehicle routing problem.	J. Comb. Optim. 2008, Volume 15	(0)	2008
	Eric Angel, Evripidis Bampis, Fanny Pascual. The impact of local policies on the quality of packet routing in paths, trees, and rings.	J. Scheduling 2008, Volume 11	(0)	2008
	Eric Angel, Evripidis Bampis, Fanny Pascual. How good are SPT schedules for fair optimality criteria.	Annals OR 2008, Volume 159	(0)	2008
	Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. On the truthfulness and the approximation for scheduling selfish tasks.	SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007 2007	(0)	2007
	Eric Angel, Evripidis Bampis, Aleksei V. Fishkin. A note on scheduling to meet two min-sum objectives.	Oper. Res. Lett. 2007, Volume 35	(0)	2007
	Eric Angel, Evripidis Bampis, Fanny Pascual. The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.	Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings 2006	(0)	2006
	Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximation algorithms for the bi-criteria weighted MAX-CUT problem.	Discrete Applied Mathematics 2006, Volume 154	(0)	2006
	Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès. Fair cost-sharing methods for the minimum spanning tree game.	Inf. Process. Lett. 2006, Volume 100	(0)	2006
	Eric Angel, Evripidis Bampis, Fanny Pascual. Truthful algorithms for scheduling selfish tasks on parallel machines.	Theor. Comput. Sci. 2006, Volume 369	(0)	2006
	Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot. (Non)-Approximability for the Multi-criteria	Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings 2005	(0)	2005
	Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.	Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers 2005	(0)	2005
	Eric Angel, Evripidis Bampis, Fanny Pascual. Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines.	Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings 2005	(0)	2005
	Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximation results for a bicriteria job scheduling problem on a single machine without preemption.	Inf. Process. Lett. 2005, Volume 94	(0)	2005
	Eric Angel, Evripidis Bampis. A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.	European Journal of Operational Research 2005, Volume 162	(0)	2005
	Eric Angel, Evripidis Bampis, Fanny Pascual. Traffic Grooming in a Passive Star WDM Network.	Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings 2004	(0)	2004
	Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.	Theor. Comput. Sci. 2004, Volume 310	(0)	2004
	Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.	Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings 2003	(0)	2003
	Eric Angel, Evripidis Bampis, Alexander Kononov. On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.	Theor. Comput. Sci. 2003, Volume 306	(0)	2003
	Eric Angel, Evripidis Bampis, Rodolphe Giroudeau. Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.	Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings 2002	(0)	2002
	Eric Angel, Vassilis Zissimopoulos. On the Hardness of the Quadratic Assignment Problem with Metaheuristics.	J. Heuristics 2002, Volume 8	(0)	2002
	Eric Angel, Evripidis Bampis, Alexander Kononov. A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.	Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings 2001	(0)	2001
	Eric Angel, Vassilis Zissimopoulos. On the landscape ruggedness of the quadratic assignment problem.	Theor. Comput. Sci. 2001, Volume 263	(0)	2001
	Eric Angel, Vassilis Zissimopoulos. On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.	Discrete Applied Mathematics 2000, Volume 99	(0)	2000
	Eric Angel, Vassilis Zissimopoulos. On the Quality of Local Search for the Quadratic Assignment Problem.	Discrete Applied Mathematics 1998, Volume 82	(0)	1998
	Eric Angel, Vassilis Zissimopoulos. Autocorrelation Coefficient for the Graph Bipartitioning Problem.	Theor. Comput. Sci. 1998, Volume 191	(0)	1998

Your query returned 28 matches in the database.