On the minimum link-length rectilinear spanning path problem: Complexity and algorithms

IEEE Transactions on Computers

Volumn 63, Issue 12, 2014, Pages 3092-3100

  Wang, Jianxin ^a   Tan, Peiqiang ^a   Yao, Jinyi ^a   Feng, Qilong ^a   Chen, Jianer ^a,b  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Computational geometry; Line cover; Parameterized algorithm; Spanning path; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; PARAMETERIZATION; PIECEWISE LINEAR TECHNIQUES;

EUCLIDEAN SPACES; LINE-COVER; LINE-SEGMENTS; PARAMETERIZED; PARAMETERIZED ALGORITHM; PIECEWISE-LINEAR; POSITIVE INTEGERS; SPANNING PATH;

TRAVELING SALESMAN PROBLEM;

EID: 84900031618     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2013.163     Document Type: Article

References (23)

1. E. Arkin, M. Bender, E. Demaine, S. Fekete, J. Mitchell, and S. Sethia, "Optimal covering tours with turn costs," SIAM J. Comput., vol. 35, pp. 531-566, 2005.
2. E. Arkin, J. Mitchell, and C. Piatko, "Minimum-link watchman tours," Inf. Process. Lett., vol. 86, pp. 203-207, 2003.
3. S. Bereg, P. Bose, A. Dumitrescu, F. Hurtado, and P. Valtr, "Traversing a set of points with a minimum number of turns," Discrete Comput. Geometry, vol. 41, pp. 513-532, 2009.
4. M. Berg, M. Kreveld, B. Nilsson, and M. Overmars, "Shortest path queries in rectilinear worlds," Int. J. Comput. Geometry Appl., vol. 2, pp. 287-309, 1992.
5. J. Chen, X. Huang, I. Kanj, and G. Xia, "Strong computational lower bounds via parameterized complexity," J. Comput. Syst. Sci., vol. 72, pp. 1346-1367, 2006.
6. J. Chen and I. Kanj, "Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms," J. Comput. Syst. Sci., vol. 67, pp. 833-847, 2003.
7. M. Collins, "Covering a set of points with a minimum number of turns," Int. J. Comput. Geometry Appl., vol. 14, pp. 105-114, 2004.
8. R. Downey and M. Fellows, Parameterized Complexity. Springer, 1999.
9. V. Estivill-Castro, A. Heednacram, and F. Suraweera, "NP-Completeness and FPT results for rectilinear covering problems," J. Universal Comput. Sci., vol. 15, pp. 622-652, 2010.
10. V. Estivill-Castro, A. Heednacram, and F. Suraweera, "FPT-Algorithms for minimum-bends tours," Int. J. Comput. Geometry, vol. 21, pp. 189-231, 2011.
11. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
12. M. Grantson and C. Levcopoulos, "Covering a set of points with a minimum number of lines," in Proc. 6th Italian Conf. Algorithms Complexity (CIAC), 2006, vol. 3998, pp. 6-17.
13. N. Hansan and C. Liu, "Minimum fault coverage in reconfigurable arrays," in Proc. 18th Int. Symp. Fault-Tolerant Comput. (FTCS), 1988, pp. 348-353.
14. R. Hassin and N. Megiddo, "Approximation algorithms for hitting objects with straight lines," Discrete Appl. Mathematics, vol. 30, pp. 29-42, 1991.
15. M. Held and R. Karp, "The traveling-salesman problem and minimum spanning trees," Operations Research, vol. 18, pp. 1138-1162, 1970.
16. M. Jiang, "On covering points with minimum turns," in Proc. Joint Int. Conf. FAW-AAIM, 2012, vol. 7285, pp. 58-69.
17. V. Kumar, S. Arya, and H. Ramesh, "Hardness of set cover with intersection 1," in Proc. 27th Int. Colloquium Automata, Language Programming (ICALP), 2000, vol. 1853, pp. 624-635.
18. D. Lee, T. Chen, and C. Yang, "Shortest rectilinear paths among weighted obstacles," in Proc. 6th Ann. Symp. Comput. Geometry (SCG), 1990, pp. 301-310.
19. D. Lee, C. Yang, and C. Wong, "Rectilinear paths among rectilinear obstacles," Discrete Appl. Math., vol. 70, pp. 185-215, 1996.
20. L. Lovasz and M. Plummer, Matching theory. North-Holland, 1986.
21. C. Stein and D. Wagner, "Approximation algorithms for the minimum bends traveling salesman problem," in Proc. 8th Int. Conf. Integer Programming Combinatorial Optimization (IPCO), 2001, vol. 2081, pp. 406-421.
22. J. Wang, W. Li, and J. Chen, "A parameterized algorithm for the hyperplane-cover problem," Theoretical Comput. Sci., vol. 411, pp. 4005-4009, 2010.
23. J. Wang, J. Yao, Q. Feng, and J. Chen, "Improved FPT algorithms for rectilinear k-links spanning path," in Proc. 9th Ann. Conf. Theory Appl. Models Comput. (TAMC), 2012, vol. 7287, pp. 560-571.