An improved upper bound for the TSP in cubic 3-edge-connected graphs

Operations Research Letters

Volumn 33, Issue 5, 2005, Pages 467-474

  Gamarnik, David ^b   Lewenstein, Moshe ^a   Sviridenko, Maxim ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Graphs; Regular graphs; Travelling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; HAMILTONIANS; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION ALGORITHMS; GRAPHS; REGULAR GRAPHS; SUBTOUR ELIMINATION RELAXATION (SER);

TRAVELING SALESMAN PROBLEM;

EID: 19944415921     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.09.005     Document Type: Article

References (11)

1. S. Arora Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems J. ACM 45 5 1998 753 782
2. S. Arora, M. Grigni, D. Karger, P. Klein, A. Woloszyn, A polynomial-time approximation scheme for weighted planar graph TSP, Proceedings of the Symposium on Discrete Algorithms, 1998, pp. 33-41.
3. D. Arun Kumar, and C. Pandu Rangan Approximation algorithms for the traveling salesman problem with range condition Theoret. Inform. Appl. 34 3 2000 173 181
4. M. Behzad, G. Chartrand, and L. Lesniak-Foster Graphs and Digraphs 1979 PWS Publishers Massachusetts
5. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Technical Report, Carnegie Mellon University, 1976.
6. G. Gutin, A. Punnen (Eds.), The Traveling Salesman Problem and its Variations, Kluwer Academic Publishers, Dordrecht, 2002.
7. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, John Wiley, New York, 1985.
8. C.H. Papadimitriou, and M. Yannakakis The traveling salesman problem with distances one and two Math. Oper. Res. 18 1993 1 11
9. J. Petersen Die Theorie der Regulären Graphen Acta Math. 15 1891 193 220
10. D.B. Shmoys, and D.P. Williamson Analyzing the Held-Karp TSP bound a monotonicity property with application Inform. Process. Lett. 35 6 1990 281 285
11. L. Wolsey Heuristic analysis, linear programming and branch and bound Math. Programming Stud. 13 1980 121 134