A note on maximum independent sets in rectangle intersection graphs

Information Processing Letters

Volumn 89, Issue 1, 2004, Pages 19-23

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Computational geometry; Dynamic programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; GRAPH THEORY;

MAP LABELING;

SET THEORY;

EID: 0345329314     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.09.019     Document Type: Article

References (10)

1. Agarwal P.K., van Kreveld M., Suri S. Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl. 11:1998;209-218.
2. Berman P., DasGupta B., Muthukrishnan S., Ramaswami S. Efficient approximation algorithms for tiling and packing problems with rectangles. J. Algorithms. 41:2001;443-470.
3. Chan T.M. Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms. 46:2003;178-189.
4. Eppstein D., Erickson J. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom. 11:1994;321-350.
5. Erlebach T., Jansen K., Seidel E. Polynomial-time approximation schemes for geometric graphs. Proc. 12th ACM-SIAM Symp. on Discrete Algorithms. 2001;671-679.
6. Fowler R.J., Paterson M.S., Tanimoto S.L. Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12:1981;133-137.
7. Hochbaum D.S., Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM. 32:1985;130-136.
8. Imai H., Asano T. Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms. 4:1983;310-323.
9. Khanna S., Muthukrishnan S., Paterson M. On approximating rectangle tiling and packing. Proc. 9th ACM-SIAM Symp. on Discrete Algorithms. 1998;384-393.
10. Nielsen F. Fast stabbing of boxes in high dimensions. Theoret. Comput. Sci. 246:2000;53-72.