Approximation algorithms for multi-criteria traveling salesman problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4368 LNCS, Issue , 2007, Pages 302-315

  Manthey, Bodo ^a   Ram, L Shankar ^b  

^a YALE UNIVERSITY   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; PARETO PRINCIPLE; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

APPROXIMATE PARETO CURVES; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 38149133206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11970125_24     Document Type: Conference Paper

References (22)

1. Eric Angel, Evripidis Bampis, and Laurent Gourvés. Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem. Theoretical Computer Science, 310(1-3):135-146, 2004.
2. Eric Angel, Evripidis Bampis, Laurent Gourvès, and Jérome Monnot. (Non-)approximability for the multi-criteria TSP(1,2). In Maciej Liśkiewicz and Rüdiger Reischuk, editors, Proc. of the 15th Int. Symp. on Fundamentals of Computation Theory (FCT), volume 3623 of Lecture Notes in Computer Science, pages 329-340. Springer, 2005.
3. Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.
4. Francisco Barahona and William R. Pulleyblank. Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 16(2):91-99, 1987.
5. Piotr Berman and Marek Karpinski. 8/7-approximation algorithm for (1,2)-TSP. In Proc. of the 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 641-648. SIAM, 2006.
6. Markus Bläser. A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, and Dana Ron, editors, Proc. of the 7th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 3122 of Lecture Notes in Computer Science, pages 61-71. Springer, 2004.
7. Markus Bläser, Bodo Manthey, and Jiří Sgall. An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms, to appear.
8. Hans-Joachim Böckenhauer, Juraj Hromkovič, Ralf Klasing, Sebastian Seibert, and Walter Unger. Approximation algorithms for the TSP with sharpened triangle inequality. Information Processing Letters, 75(3):133-138, 2000.
9. L. Sunil Chandran and L. Shankar Ram. Approximations for ATSP with parameterized triangle inequality. In Helmut Alt and Afonso Ferreira, editors, Proc. of the 19th Int. Symp. on Theoretical Aspects of Computer Science (STACS), volume 2285 of Lecture Notes in Computer Science, pages 227-237. Springer, 2002.
10. Nicos Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 1976.
11. Matthias Ehrgott. Approximation algorithms for combinatorial multicriteria optimization problems. International Transactions in Operational Research, 7(1):5-31, 2000.
12. Matthias Ehrgott. Multicriteria Optimization. Springer, 2005.
13. Matthias Ehrgott and Xavier Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum, 22(4):425-460, 2000.
14. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
15. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, and Maxim Sviridenko. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM, 52(4):602-626, 2005.
16. Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, and David B. Shmoys, editors. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, 1985.
17. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-113, 1987.
18. Christos H. Papadimitriou. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982.
19. Christos H. Papadimitriou and Mihalis Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proc. of the 41st Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pages 86-92. IEEE Computer Society, 2000.
20. Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis II. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3):563-581, 1977.
21. William T. Tutte. A short proof of the factor theorem for finite graphs. Canadian Journal of Mathematics, 6:347-352, 1954.
22. Vijay V. Vazirani. Approximation Algorithms. Springer, 2001.