NP-completeness and FPT results for rectilinear covering problems

Journal of Universal Computer Science

Volumn 16, Issue 5, 2010, Pages 622-652

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

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Computational geometry; Parameterized complexity; Restricted orientations

Indexed keywords

EID: 77952400748     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Arkin, E., Bender, M., Demaine, E., Fekete, S., Mitchell, J. and Sethia, S. 2005, 'Optimal covering tours with turn costs', SIAM J. of Computing 35, 531-566.
2. Arkin, E., Mitchell, J. and Piatko, C. 2003, 'Minimum-link watchman tours', Information Processing Letters 86(4), 203-207.
3. Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F. and Valtr, P. 2009, 'Traversing a set of points with a minimum number of turns', Discrete and Computational Geometry 41, 513-532.
4. Collins, M. 2004, 'Covering a set of points with a minimum number of turns', International J. Computational Geometry and Applications 14(1-2), 105-114.
5. de Berg, M., van Kreveld, M., Nilsson, B. and Overmars, M. 1992, 'Shortest path queries in rectilinear worlds', International Journal Computational Geometry Applications 2(3), 287-309.
6. Downey, R. and Fellows, M. 1999, Parameterized Complexity, Monographs in Computer Science, Springer, New York.
7. Estivill-Castro, V., Heednacram, A. and Suraweera, F. 2009, 'Reduction rules deliver efficient FPT-algorithms for covering points with lines', ACM Journal of Experimental Algorithmics 14, 1.7-1.26.
8. Fink, E. and Wood, D. 1996, 'Fundamentals of restricted-orientation convexity', Information Sciences 92(1-4), 175-196.
9. Fink, E. and Wood, D. 2004, Restricted-Orientation Convexity, Monographs in Theoretical Computer Science. An EATCS Series, Springer, New York.
10. Flum, J. and Grohe, M. 2006, Parameterized Complexity Theory, Texts in Theoretical Computer Science, Springer, Berlin.
11. Garey, M. and Johnson, G. 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, USA.
12. Grantson, M. and Levcopoulos, C. 2006, Covering a set of points with a minimum number of lines, in 'Algorithms and Complexity, 6th Italian Conference, CIAC', Vol. 3998 of Lecture Notes in Computer Science, Springer, Berlin, pp. 6-17.
13. Güting, H. 1983, 'Stabbing c-oriented polygons', Information Processing Letters 16,35-40.
14. Hassin, R. and Megiddo, N. 1991, 'Approximation algorithms for hitting objects with straight lines', Discrete Applied Mathematics 30(1), 29-42.
15. Hurtado, F. 2008. Private communication.
16. Kumar, V., Arya, S. and Ramesh, H. 2000, Hardness of set cover with intersection 1, in '27th International Colloquium on Automata, Languages and Programming, ICALP', Vol. 1853 of Lecture Notes in Computer Science, Springer, Berlin, pp. 624-635.
17. Langerman, S. and Morin, P. 2005, 'Cover things with things', Discrete and Computational Geometry 33(4), 717-729.
18. Lee, D., Chen, T. and Yang, C. 1990, Shortest rectilinear paths among weighted obstacles, in '6th ACM Symposium on Computational Geometry (SCG 90)', ACM, NY, pp. 301-310.
19. Lee, D., Yang, C. and Wong, C. 1996, 'Rectilinear paths among rectilinear obstacles', Discrete Applied Mathematics 70(3), 185-215.
20. Megiddo, N. and Tamir, A. 1982, 'On the complexity of locating linear facilities in the plane', Operations Research Letters 1(5), 194-197.
21. Niedermeier, R. 2006, Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications 31, Oxford University Press, New York.
22. Rawlins, G. and Wood, D. 1988, Computational geometry with restricted orientations, in '13th IFIP Conference on System Modelling and Optimization', Vol. 113 of Lecture Notes in Computer Science, Springer, Berlin, pp. 375-384.
23. Rawlins, G. and Wood, D. 1991, 'Restricted-oriented convex sets', Information Sciences 54, 263-281.
24. Wagner, D. 2006, Path Planning Algorithms under the Link-Distance Metric, PhD thesis, Dartmouth College, Hanover, NH, USA.