Exact algorithms and APX-hardness results for geometric set cover

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Volumn , Issue , 2011, Pages

  Chan, Timothy M ^a   Grant, Elyot ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDEAN SPACES; EXACT ALGORITHMS; GEOMETRIC OBJECTS; HARDNESS RESULT; HITTING SET PROBLEMS; MINIMUM VERTEX COVER PROBLEMS; POLYNOMIAL-TIME DYNAMIC PROGRAMMING; SET COVER PROBLEM;

ALGORITHMS; HARDNESS;

COMPUTATIONAL GEOMETRY;

EID: 84883033727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. B. Aronov, E. Ezra, and M. Sharir. Small-size ε-nets for axis-parallel rectangles and boxes. In ACM Symposium on Theory of Computing (2009), 639-648.
2. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoretical Comp. Sci. 237 (2000) 123-134.
3. C. Ambühl, T. Erlebach, M. Mihalák, and M. Nunkesser. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In APPROX and RANDOM (2006) 3-14.
4. P. K. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky. Lenses in arrangements of pseudocircles and their applications. J. ACM 51(2) (2004), 139-186.
5. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications (Third edition). Springer-Verlag, Heidelberg, (2008).
6. P. Berman and B. DasGupta. Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4) (1997), 331-356.
7. H. Brönnimann and O. Devillers The union of unit balls has quadratic complexity, even if they all contain the origin. arXiv:cs/9907025v1 [cs.CG] (1999).
8. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14 (1995), 263-279.
9. N. Bansal and K. Pruhs. The geometry of scheduling. IEEE 51st Annual Symposium on Foundations of Computer Science (2010), 407-414.
10. D. Chakrabarty, E. Grant, and J. Koenemann. On column-restricted and priority covering integer programs. In Integer Programming and Combinatorial Optimization (2010) 355-368.
11. Y. Cheng, S.S. Iyengar, and R.L. Kashyap. A new method for image compression using irreducible covers of maximal rectangles. IEEE Trans. Software Engrg. 14 (1988), 651-658.
12. K. Clarkson and K. Varadarajan. Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37 (2007), 43-58.
13. G. Even, D. Rawitz, and S. Shahar. Hitting sets when the VC-dimension is small. Information Processing Letters 95(2) (2005), 358-362.
14. T. Erlebach and E. J. van Leeuwen PTAS for weighted set cover on unit squares. In APPROX and RANDOM (2010), 166-177.
15. A. Hegedüs. Algorithms for covering polygons with rectangles. Comput. Aided Geom. Design 14 (1982), 257-260.
16. S. Har-Peled. Being Fat and Friendly is Not Enough. arXiv:0908.2369v1 [cs.CG] (2009).
17. S. Har-Peled and M. Lee. Weighted geometric set cover problems revisited. Unpublished manuscript, (2008).
18. D.S. Hochbaum and W. Maass. Fast approximation algorithms for a nonconvex covering problem. J. Algorithms 8(3) (1987), 305-323.
19. N.H. Mustafa and S Ray. Improved results on geometric hitting set problems. Discrete Comput. Geom. 44(4) (2010), 883-895.
20. J. Pach, G. Tardos. Tight lower bounds for the size of epsilon-nets. In Proc. 27th ACM Sympos. Comput. Geom. (2011) 458-463.
21. C.H. Papadimitriou, M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Systems Sci. 43 (1991), 425-440.
22. K. Varadarajan. Weighted geometric set cover via quasi-uniform sampling. In ACM Symposium on Theory of Computing (2010) 641-648.
23. E. J. van Leeuwen. Optimization and Approximation on Systems of Geometric Objects. PhD thesis, Universiteit van Amsterdam, (2009).