On covering points with minimum turns

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

Volumn 7285 LNCS, Issue , 2012, Pages 58-69

  Jiang, Minghui ^a  

^a Utah State University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FPT ALGORITHMS; NP-HARDNESS; SPANNING PATH;

ALGORITHMS;

HARDNESS;

EID: 84861206654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29700-7_6     Document Type: Conference Paper

References (19)

1. Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM Journal on Computing 29, 697-711 (1999)
2. Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Minimum-link watchman tours. Information Processing Letters 86, 203-207 (2003)
3. Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM Journal on Computing 35, 531-566 (2005)
4. 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, 513-532 (2009)
5. Collins,M.J.: Covering a set of points with a minimum number of turns. International Journal of Computational Geometry and Applications 14, 105-114 (2004)
6. Collins, M.J., Moret, B.M.E.: Improved lower bounds for the link length of rectilinear spanning paths in grids. Information Processing Letters 68, 317-319 (1998)
7. Estivill-Castro, V., Heednacram, A., Suraweera, F.: NP-completeness and FPT results for rectilinear covering problems. Journal of Universal Computer Science 15, 622-652 (2010)
8. Estivill-Castro, V., Heednacram, A., Suraweera, F.: FPT-algorithms for minimum-bends tours. International Journal of Computational Geometry 21, 189-213 (2011)
9. Fekete, S.P.,Woeginger, G.J.: Angle-restricted tours in the plane. Computational Geometry: Theory and Applications 8, 195-218 (1997)
10. Gaur, D.R., Bhattacharya, B.: Covering points by axis parallel lines. In: Proceedings of the 23rd European Workshop on Computational Geometry, pp. 42-45 (2007)
11. Grantson, M., Levcopoulos, C.: Covering a set of points with a minimum number of lines. In: Proceedings of the 22nd European Workshop on Computational Geometry, pp. 145-148 (2006)
12. Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30, 29-42 (1991)
13. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAMJournal on Computing 11, 676-686 (1982)
14. Langerman, S., Morin, P.: Covering things with things. Discrete & Computational Geometry 33, 717-729 (2005)
15. Kranakis, E., Krizanc, D.,Meertens, L.: Link length of rectilinear Hamiltonian tours in grids. Ars Combinatoria 38, 177-192 (1994)
16. Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Operations Research Letters 1, 194-197 (1982)
17. Stein, C.,Wagner, D.P.: Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 406-421. Springer, Heidelberg (2001)
18. Wagner, D.P.: Path Planning Algorithms under the Link-Distance Metric. Ph.D. thesis, Dartmouth College (2006)
19. Wang, J., Li, W., Chen, J.: A parameterized algorithm for the hyperplane-cover problem. Theoretical Computer Science 411, 4005-4009 (2010)