FPT-algorithms for minimum-bends tours

International Journal of Computational Geometry and Applications

Volumn 21, Issue 2, 2011, Pages 189-213

  Estivill Castro, Vladimir ^a   Heednacram, Apichat ^a   Suraweera, Francis ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Computational geometry; covering with hyperplanes; fixed parameter tractable; minimum bends tours

Indexed keywords

EID: 79954557610     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195911003615     Document Type: Article

References (25)

1. V. Estivill-Castro, A. Heednacram and F. Suraweera, The rectilinear k-bends TSP, eds. M. T. Thai and S. Sahni, Computing and Combinatorics, 16th Ann. Int. Conf., COCOON 2010, Lecture Notes in Computer Science, Vol. 6196, Nha Trang, Vietnam, Springer (July 19-21 2010), pp. 264-277.
2. D. Applegate, R. Bixby, V. Chv́atal and W. Cook, The Traveling Salesman Problem (Princeton University Press, Princeton, NJ, USA, 2006).
3. C. Papadimitriou, The Euclidean traveling salesman problem is NP-complete, Theoret. Comput. Sci. 4 (1977) 237-244.
4. D. Lee, C. Yang and C. Wong, Rectilinear paths among rectilinear obstacles, Discr. Appl. Math. 70(3) (1996) 185-215. (Pubitemid 126399088)
5. D. Wagner, Path planning algorithms under the link-distance metric, PhD thesis, Dartmouth College, Hanover, NH, USA (February 2006).
6. M. Klamkin, Problem 1123: Polygonal path covering a square lattice, Amer. Math. Monthly 61(6) (1954) 423.
7. M. Klamkin, E 1123, Amer. Math. Monthly 62(2) (1955) 124.
8. J. Selfridge, E 1123, Amer. Math. Monthly 62(6) (1955) 443.
9. E. Arkin, J. Mitchell and C. Piatko, Minimum-link watchman tours, Inform. Process. Lett. 86(4) (2003) 203-207.
10. V. Estivill-Castro, A. Heednacram and F. Suraweera, NP-completeness and FPT results for rectilinear covering problems, J. Universal Comput. Sci. 16(5) (2010) 622-652.
11. M. de Berg, M. van Kreveld, B. Nilsson and M. Overmars, Shortest path queries in rectilinear worlds, Int. J. Comput. Geom. Appl. 2(3) (1992).
12. D. Lee, T. Chen and C. Yang, Shortest rectilinear paths among weighted ob- stacles, 6th ACM Symp. Computational Geometry (SCG 90), ACM, NY (1990), pp. 301-310. (Pubitemid 20728505)
13. E. Arkin, M. Bender, E. Demaine, S. Fekete, J. Mitchell and S. Sethia, Optimal covering tours with turn costs, SIAM J. Comput. 35(3) (2005) 531-566. (Pubitemid 43952261)
14. S. Bereg, P. Bose, A. Dumitrescu, F. Hurtado and P. Valtr, Traversing a set of points with a minimum number of turns, Discr. Comput. Geom. 41 (2009) 513-532.
15. M. Collins, Covering a set of points with a minimum number of turns, Int. J. Comput. Geom. Appl. 14(1-2) (2004) 105-114. (Pubitemid 39442952)
16. R. Drysdale, C. Stein and D. Wagner, An O(n5/2 log n) algorithm for the rectilin- ear minimum link-distance problem, 17th Canadian Conf. Computational Geometry, University of Windsor, Ontario, Canada (2005), pp. 97-100.
17. C. Stein and D. Wagner, Approximation algorithms for the minimum bends traveling salesman problem, eds. K. Aardal and B. Gerards, 8th Int. IPCO Conf., Lecture Notes in Computer Science, Vol. 2081 (Springer, Berlin, June 13-15 2001), pp. 406-422. (Pubitemid 33291977)
18. R. Downey and M. Fellows, Parameterized Complexity, Monographs in Computer Science (Springer, New York, 1999).
19. J. Flum and M. Grohe, Parameterized Complexity Theory, Texts in Theoretical Com- puter Science (Springer, Berlin, 2006).
20. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications, Vol. 31 (Oxford University Press, New York, 2006).
21. N. Megiddo and A. Tamir, On the complexity of locating linear facilities in the plane, Operat. Res. Lett. 1(5) (1982) 194-197. (Pubitemid 13489352)
22. S. Langerman and P. Morin, Cover things with things, Discr. Comput. Geom. 33(4) (2005) 717-729.
23. L. Guibas, M. Overmars and J. Robert, The exact fitting problem for points, 3rd Canadian Conf. Computational Geometry, Simon Fraser University, Vancouver, British Columbia (August 6-10 1991), pp. 171-174.
24. L. Guibas, M. Overmars and J. Robert, The exact fitting problem in higher dimen- sions, Comput. Geom.: Th. Appl. 6 (1996) 215-230. (Pubitemid 126363261)
25. V. Kumar, S. Arya and H. Ramesh, Hardness of set cover with intersection 1, 27th Int. Colloquium on Automata, Languages and Programming, ICALP, Lecture Notes in Computer Science, Vol. 1853 (Springer, Berlin, 2000), pp. 624-635.