Differential approximation results for the traveling salesman problem with distances 1 and 2

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

Volumn 2138, Issue , 2001, Pages 275-286

  Monnot, Jérôme ^a   Paschos, Vangelis T ^a   Toulouse, Sophie ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

APPROXIMATION RATIOS; COMPLETE GRAPHS; DIFFERENTIAL APPROXIMATIONS; EDGE DISTANCE; MAXIMUM TRAVELING SALESMAN PROBLEM; NP-HARD; TRAVELING SALESMAN;

TRAVELING SALESMAN PROBLEM;

EID: 84974684564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_27     Document Type: Conference Paper

References (15)

1. A. Aiello, E. Burattini, M. Furnari, A. Massarotti, and F. Ventriglia. Computational complexity: the problem of approximation. In C. M. S. J. Bolyai, editor, Algebra, combinatorics, and logic in computer science, volume I, pages 51–62, New York, 1986. North-Holland.
2. G. Ausiello, A. D’Atri, and M. Protasi. Structure preserving reductions among convexoptimization problems. J. Comput. System Sci., 21:136–153, 1980.
3. G. Ausiello, A. Marchetti-Spaccamela, and M. Protasi. Towards a unified approach for the classification of NP-complete optimization problems. Theoret. Comput. Sci., 12:83–96, 1980.
4. M. Bellare and P. Rogaway. The complexity of approximating a nonlinear program. Math. Programming, 69:429–441, 1995.
5. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science, 23(8):789–810, 1977.
6. M. Demange, P. Grisoni, and V. T. Paschos. Differential approximation algorithms for some combinatorial optimization problems. Theoret. Comput. Sci., 209:107–122, 1998.
7. M. Demange and V. T. Paschos. On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoret. Comput. Sci., 158:117–141, 1996.
8. L. Engebretsen. An explicit lower bound for TSP with distances one and two. In Proc. STACS’99, volume 1563 of LNCS, pages 373–382. Springer, 1999.
9. M. R. Garey and D. S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
10. D. B. Hartvigsen. Extensions of matching theory. PhD thesis, Carnegie-Mellon University, 1984.
11. J. Monnot, V. T. Paschos, and S. Toulouse. Differential approximation results for the traveling salesman problem. Cahier du LAMSADE 172, LAMSADE, Université Paris-Dauphine, 2000.
12. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. Oper. Res., 18:1–11, 1993.
13. A. I. Serdyukov. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 25:80–86, 1984.
14. S. A. Vavasis. Approximation algorithms for indefinite quadratic programming. Math. Programming, 57:279–311, 1992.
15. E. Zemel. Measuring the quality of approximate solutions to zero-one programming problems. Math. Oper. Res., 6:319–332, 1981.