Improved FPT algorithms for rectilinear k-links spanning path

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

Volumn 7287 LNCS, Issue , 2012, Pages 560-571

  Wang, Jianxin ^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

[No Author keywords available]

Indexed keywords

FPT ALGORITHMS; LINE-SEGMENTS; NP COMPLETE; NP-COMPLETENESS; PIECEWISE LINEAR; POSITIVE INTEGERS; RUNNING TIME; SPANNING PATH; TSP PROBLEMS;

PIECEWISE LINEAR TECHNIQUES;

COMPUTATIONAL COMPLEXITY;

EID: 84861007873     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29952-0_52     Document Type: Conference Paper

References (13)

1. Lee, D.T., Yang, C.D., Wong, C.K.: Rectilinear Paths among Rectilinear Obstacles. Discrete Applied Mathematics 70(3), 185-215 (1996)
2. Arkin, E.M., Mitchell, J., Piatko, C.D.: Minimum-link watchman tours. Inf. Process. Lett. 86(4), 203-207 (2003)
3. Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., Valtr, P.: Traversing a Set of Points with a Minimum Number of Turns. Discrete & Computational Geometry 41(4), 513-532 (2009)
4. Lee, D.T., Chen, T.H., Yang, C.: Shortest Rectilinear Paths among Weighted Obstacles. In: Proc. Symposium on Computational Geometry, pp. 301-310 (1990)
5. Berg, M., Kreveld, M.J., Nilsson, B.J., Overmars, M.H.: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl. 2(3), 287-309 (1992)
6. Collins, M.J.: Covering a Set of Points with a Minimum Number of Turns. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 467-474. Springer, Heidelberg (2003)
7. Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J., Sethia, S.: Optimal Covering Tours with Turn Costs. SIAM J. Comput. 35(3), 531-566 (2005)
8. Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30(1), 29-42 (1991)
9. Estivill-Castro, V., Heednacram, A., Suraweera, F.: NP-completeness and FPT Results for Rectilinear Covering Problems. J. UCS 16(5), 622-652 (2010)
10. Kuo, S., Fuchs, W.K.: Efficient spare allocation in reconfigurable arrays. In: DAC, pp. 385-390 (1986)
11. Kumar, V.S.A., Arya, S., Ramesh, H.: Hardness of Set Cover with Intersection 1. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 624-635. Springer, Heidelberg (2000)
12. Grantson, M., Levcopoulos, C.: Covering a Set of Points with a Minimum Number of Lines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 6-17. Springer, Heidelberg (2006)
13. Wang, J., Li, W., Chen, J.: A parameterized algorithm for the hyperplane-cover problem. Theor. Comput. Sci. 411(44-46), 4005-4009 (2010)