Optimal covering tours with turn costs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 138-147

  Arkin, Esther M ^a   Bender, Michael A ^a   Demaine, Erik D ^b   Fekete, Sándor P ^c   Mitchell, Joseph S B ^a   Sethia, Saurabh ^a  

^a USA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Covering; Lawn mowing; M guillotine subdivisions; Manufacturing; Milling; NC machining; NP completeness; Polynomial time approximation scheme (PTAS); Traveling salesman problem (TSP); Turn costs

Indexed keywords

EID: 64049083912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber, The angular-metric traveling salesman problem, Proceedings of the eighth annual ACMSIAM symposium on Discrete algorithms, p.221-229, January 05-07, 1997, New Orleans, Louisiana, United States
2. Muhammad H. Alsuwaiyel, D. T. Lee, Minimal link visibility paths inside a simple polygon, Computational Geometry: Theory and Applications, v.3 n.1, p.1-25, June 1993 [doi〉10.1016/0925-7721(93)90027-4]
3. Muhammad H. Alsuwaiyel, D. T. Lee, Finding an approximate minimum-link visibility path inside a simple polygon, Information Processing Letters, v.55 n.2, p.75-79, July 21, 1995 [doi〉10.1016/0020-0190(95)00072-K]
4. E. M. Arkin, M. A. Bender, E. D. Demaine, S. P. Fekete, J. S. B. Mitchell, and S. Sethia. Optimal covering tours with turn costs. Technical Report 674, TU Berlin, 2000. Available at http://www.math.tu-berlin. de/coga/publications/techreports/2000/ Report-674-2000.html.
5. E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Comput. Geom., pp. 461-466, 1993.
6. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell, Approximation algorithms for lawn mowing and milling, Computational Geometry: Theory and Applications, v.17 n.1-2, p.25-50, Oct. 2000 [doi〉10.1016/S0925- 7721(00)00015-8]
7. E. M. Arkin, M. Held, and C. L. Smith. Optimization problems related to zigzag pocket machining. Algorithmica, 26(2), pp. 197-236, 2000.
8. E.M. Arkin, J. S. B. Mitchell, and C. Piatko. Minimumlink watchman tours. Technical report, SUNY Stony Brook, 1994.
9. Sunil Arya, Siu-Wing Cheng, David M. Mount, Approximation algorithms for multiple-tool miling, Proceedings of the fourteenth annual symposium on Computational geometry, p.297-306, June 07-10, 1998, Minneapolis, Minnesota, United States [doi〉10.1145/276884.276918]
10. A. A. Assad and B. L. Golden. Arc routing methods and applications. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, pp. 375-483. Elsevier Science, Amsterdam, 1995.
11. Enrique Benavent, David Soler, The Directed Rural Postman Problem with Turn Penalties, Transportation Science, v.33 n.4, p.408-418, April 1999
12. Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991
13. 3. Clossey, G. Laporte, and P. Soriano. Solving arc routing problems with turn penalties. Technical Report G-2000-05, Le Groupe d'etudes et de recherche en analyse des decisions, Montreal, Canada, 2000.
14. Michael J. Collins, Bernard M. E. Moret, Improved lower bounds for the link length of rectilinear spanning paths in grids, Information Processing Letters, v.68 n.6, p.317-319, Dec 1998 [doi〉10.1016/S0020-0190(98)00178-1]
15. H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part I: The Chinese postman problem. Operations Research, 43(2), pp. 231-242, 1995.
16. H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems, part II: The rural postman problem. Operations Research, 43(3), pp. 399-414, 1995.
17. S. P. Fekete. Geometry and the Travelling Salesman Problem. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1992.
18. Sándor P. Fekete, Gerhard J. Woeginger, Angle-restricted tours in the plane, Computational Geometry: Theory and Applications, v.8 n.4, p.195-218, Sept. 1997 [doi〉10.1016/S0925-7721(96)00012-0]
19. D. S. Fernandez. Problemas de Rutas pot Arcos con Giros Prohibidos. Ph.D. thesis, Universitat de Valencia, 1995.
20. Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
21. Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
22. A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter. Hamilton paths in grid graphs. SIAM J. Comput., 11, pp. 676-686, 1982.
23. Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki, The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection, Proceedings of the 5th International Symposium on Algorithms and Computation, p.29-37, August 25-27, 1994
24. D. S. Johnson and C. H. Papadimitriou. Computational complexity and the traveling salesman problem. In E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys, editors, The Traveling Salesman Problem, pp. 68-74. John Wiley & Sons, New York, 1985.
25. E. Kranakis, D. Krizanc, and L. Meertens. Link length of rectilinear Hamiltonian tours on grids. Ars Combinatoria, 38, pp. 177-192, 1994.
26. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York, 1976.
27. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: Part I I I - Faster polynomialtime approximation schemes for geometric network optimization. Manuscript, SUNY Stony Brook, 1997.
28. 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, v.28 n.4, p.1298-1309, Aug. 1999 [doi〉10.1137/S0097539796309764]
29. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 15, pp. 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
30. E. M. Molada and D. S. Ferngmdez. Exact solution of the Chinese postman problem with turn penalties. In XV Congress on Differential Equations and Applications/V Congress on Applied Mathematics, volume I, II (Spanish), Colecc. Congr., 9, pp. 1111-1115, 1998.
31. Simeon Ntafos, Watchman routes under limited visibility, Computational Geometry: Theory and Applications, v.1 n.3, p.149-170, March 1992 [doi〉10.1016/S0925-7721(99) 00022-X]
32. William Lenhart, Christopher Umans, Hamiltonian Cycles in Solid Grid Graphs, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.496, October 19-22, 1997
33. D. West. An Introduction to Graph Theory. Prentice Hall, 1995. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal, Online searching with turn cost, Theoretical Computer Science, v.361 n.2, p.342-355, 1 September 2006
34. Sándor P. Fekete, Marco E. Lübbecke , Henk Meijer, Minimizing the stabbing number of matchings, trees, and triangulations, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana