Approximation algorithms for the minimum bends traveling salesman problem

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

Volumn 2081, Issue , 2001, Pages 406-421

  Stein, Clifford ^a   Wagner, David P ^a  

^a Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GEOMETRY; INTEGER PROGRAMMING; OPTIMIZATION;

ALGORITHMIC TECHNIQUES; EUCLIDEAN PLANES; LOGARITHMIC APPROXIMATION; MINIMIZING THE NUMBER OF; OPTIMAL TOURS; TOTAL DISTANCES; TWO-POINT;

TRAVELING SALESMAN PROBLEM;

EID: 84947286513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (32)

1. F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, and N. Pa-pakostantinou. The complexity of the travelling repairman problem. Informatique Theoretique et Applications, pages 79-87, 1986.
2. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, and Baruch Schieber. The angular-metric traveling salesman problem. SIAM Journal on Computing, 29(3):697-711, June 2000.
3. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sandor P. Fekete, Joseph S. B. Mitchell, and Saurabh Sethia. Optimal covering tours with turn costs. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 138-147, Washington, DC, 2001.
4. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven S. Skiena, and Tae-Cheon Yang. On the maximum scatter TSP (extended abstract). In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211-220, New Orleans, Louisiana, 5-7 January 1997.
5. S. Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. JACM: Journal of the ACM, 45, 1998.
6. A. Barvinok, Sandor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeg-inger, and D. Woodroofe. The maximum traveling salesman problem. submitted to Journal ofAlgorithms, 1998.
7. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 163-172, May 1994.
8. H. Bronnimann and M.T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Computat. Geom., 14:263-279, 1995.
9. N. Christofedes. Worst case analysis of a new heuristc for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
10. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, August 1979.
11. R. Duh and M. Furer. Approximation of k-set cover by semi-local optimization. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 256-264, 1997.
12. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for finding a maximum weight hamiltonian circuit. Operations Research, 27(4):799-809, July-August 1979.
13. R.S. Garfinkel. Minimizing wallpaper waste, part I: a class of traveling salesman problems. Operations Research, 25:741-751, 1977.
14. P.C. Gilmore and R.E. Gomory. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Operations Research, 12:655-679, 1964.
15. Rafael Hassin and Shlomi Rubinstein. Better approximations for max TSP. Information Processing Letters, 75:181-186, 2000.
16. R. Hasssin and N. Meggido. Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics, 30:29-42, 1991.
17. Dorit Hochbaum, editor. Approximation Algorithms. PWS, 1997.
18. L.J. Hubert and F.B. Baker. Applications of combinatorial programming to data analysis: the traveling salesman and related problems. Pyschometrika, 43:81-91, 1978.
19. R. Kosaraju, J. Park, and C. Stein. Long tours and short superstrings. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 166-177, 1994.
20. A. V. Kostochka and A. I. Serdyukov. Polynomial algorithms with the estimated 3/4 and 5/6 for the traveling salesman problem of the maximum (in russian). Upravlyaemye Sistemy, 26:55-59, 1985.
21. E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, editors. The Traveling Salesman Problem. John Wiley and Sons, 1985.
22. D.T. Lee, C.D. Yang, and C.K. Wong. Problem transformation for finding rectilinear paths among obstacles in two-layer interconnection model. Technical Report 92-AC-104, Dept. of EECS, Northwestern University, 1992.
23. D.T. Lee, C.D. Yang, and C.K. Wong. Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics, 70, 1996.
24. J.K. Lenstra and A.H.G. Rinnooy Kan. Some simple applications of the travelling salesman problem. Operations Research Quarterly, 26:717-733, 1975.
25. W.T. McCormick, P.J. Schweitzer, and T.W. White. Problem decomposition and datareorganization by a clustering technique. Operations Research, 20:993-1009, 1972.
26. N. Meggido and A. Tamir. On the complexity of locating linear facilities in the plane. Operations Research Letters, 1:194-197, 1982.
27. Joseph S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28:1298-1309, 1999.
28. J.S.B. Mitchell, C. Piatko, and E.M. Arkin. Computing a shortest fc-link path in a polygon. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 573-582, 1992.
29. C.D. Yang, D.T. Lee, and C.K. Wong. On bends and lengths of rectilinear paths: a graph-theoretic approach. Internat. J. Comp. Geom. Appl., 2:61-74, 1992.
30. C.D. Yang, D.T. Lee, and C.K. Wong. On minimum-bend shortest recilinear path among weighted rectangles. Technical Report 92-AC-122, Dept. of EECS, Northwestern University, 1992.
31. C.D. Yang, D.T. Lee, and C.K. Wong. Rectilinear path problems among rectilinear obstacles revisited. SIAM Journal on Computing, 24:457-472, 1992.
32. C.D. Yang, D.T. Lee, and C.K. Wong. On bends and distance paths among obstacles in two-layer interconnection model. IEEE Transactions on Computers, 43:711-724, 1994.