(Non)-approxirnability for the multi-criteria TSP (1, 2)

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 329-340

  Angel, Eric ^a   Bampis, Evripidis ^a   Gourvès, Laurent ^a   Monnot, Jérôme ^b  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

APPROXIMATION ALGORITHM; MULTI-CRITERIA OPTIMIZATION; NP-HARDNESS;

COMPUTER SCIENCE;

EID: 26844577690     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_29     Document Type: Conference Paper

References (11)

1. E. Angel, E. Bampis and L. Gourvès: Approximating the Pareto curve with local search for the bi-criteria TSP(1, 2) problem, in Proc. of FCT'2003, LNCS 2751, 39-48, 2003.
2. E. Angel, E. Bampis, L. Gourvès and J. Monnot: (Non)-Approximability for the multi-criteria TSP(1, 2). Technical Report, Université d'Evry Val d'Essonne, No 116-2005, 2005.
3. X. Deng, C.H. Papadimitriou and S. Safra: On the Complexity of Equilibria, in Proc. of STOC'2002, 67-71, 2002.
4. L. Engebretsen: An Explicit Lower Bound for TSP with Distances One and Two. Algorithmica, 35(4), 301-318, 2003.
5. D. Fotakis and P. Spirakis: A Hamiltonian Approach to the Assignment of Non-Reusable Frequencies, in Proc. of FCS&TCS'98, LNCS 1530, 18-29, 1998.
6. D.S. Johnson and C.H. Papadimitriou: Performance guarantees for heuristics, chapter in The Traveling Salesman Problem: a guided tour of Combinatorial Optimization, E.L Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), Wiley Chichester, 145-180, 1985.
7. D.E. Lucas: Récréations mathématiques. Vol. II, Gauthier Villars, Paris 1892.
8. C.H. Papadimitriou and M. Yannakakis: On the approximability of trade-offs and optimal access of web sources, in Proc. of FOCS'2000, 86-92, 2000.
9. C.H. Papadimitriou and M. Yannakakis: The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1), 1-11, 1993.
10. D.J. Rosenkrantz, R.E. Stearns and P.M. Lewis II: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comp., 6, 563-581, 1977.
11. A. Warburton: Approximation of Pareto optima in multiple-objective shortest path problems. Operations Research, 35(1), 70-79, 1987.