Independent set of intersection graphs of convex objects in 2D

Computational Geometry: Theory and Applications

Volumn 34, Issue 2, 2006, Pages 83-95

  Agarwal, Pankaj K ^a   Mustafa, Nabil H ^a  

^a Duke University   (United States)

Author keywords

Approximation algorithms; Convex objects; Geometric intersection graphs; Maximum independent set

Indexed keywords

EID: 84867921245     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.12.001     Document Type: Article

References (26)

1. P.K. Agarwal, and J. Erickson Geometric range searching and its relatives B. Chazelle, J.E. Goodman, R. Pollack, Advances in Discrete and Computational Geometry 1999 American Mathematical Society Providence, RI 1 56
2. P.K. Agarwal, M. van Kreveld, and S. Suri Label placement by maximum independent set in rectangles Computational Geometry 11 1998 209 218
3. B.S. Baker Approximation algorithms for NP-complete problems on planar graphs J. ACM 41 1994 153 180
4. J.L. Bentley, and J.B. Saxe Decomposable searching problems I: Static-to-dynamic transformation J. Algorithms 1 1980 301 358
5. P. Berman, B. DasGupta, S. Muthukrishnan, and S. Ramaswami Efficient approximation algorithms for tiling and packing problems with rectangles J. Algorithms 41 2001 443 470
6. P. Berman, T. Fujito, Approximating independent sets in degree 3 graphs, in: Proc. 4th Workshop on Algorithms and Data Structures, 1995, pp. 449-460
7. R. Boppana, M.M. Halldórsson, Approximating maximum independent sets by excluding subgraphs, in: Proc. 2nd Scandinavian Workshop on Algorithm Theory, 1990, pp. 13-25
8. T.M. Chan Polynomial-time approximation schemes for packing and piercing fat objects J. Algorithms 46 2003 178 189
9. T.M. Chan A note on maximum independent sets in rectangle intersection graphs Inform. Process. Lett. 89 2004 19 23
10. P. Dilworth A decomposition theorem for partially ordered sets Ann. of Math. 51 1950 161 166
11. T. Erlebach, K. Jansen, E. Seidel, Polynomial-time approximation schemes for geometric graphs, in: Proc. of the 12th Annual ACM-SIAM Sympos. on Discrete Algorithms, 2001, pp. 671-679
12. M. Fredman On computing the length of the longest increasing subsequence Discrete Math. 11 1975 29 35
13. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman New York
14. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs Annals of Discrete Mathematics vol. 57 2004 North-Holland Amsterdam
15. M. Grotschel, L. Lovász, and A. Schrijver Polynomial algorithms for perfect graphs Ann. Discrete Math. 21 1981 211 356
16. 1- Acta Math. 182 1999 105 142
17. H.B. Hunt, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs J. Algorithms 26 1998 238 274
18. H. Imai, and T. Asano Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane J. Algorithms 4 1983 310 323
19. J. Kratochvil, and J. Matoušek Intersection graphs of segments J. Combin. Theory Ser. B 62 1994 289 315
20. L. Lewin-Eytan, J. Naor, A. Orda, Routing and admission control in networks with advance reservations, in: Intl. Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 215-228
21. E. Malesinska, Graph-theoretical models for frequency assignment problems, Ph.D. Thesis, Technische Universität Berlin, 1997
22. J. Pach, and P.K. Agarwal Combinatorial Geometry 1995 John Wiley & Sons New York
23. J. Pach, and G. Tardos Cutting glass Discrete Comput. Geom. 24 2000 481 496
24. J. Pach, and J. Torocsik Some geometric applications of Dilworth's theorem Discrete Comput. Geom. 12 1994 1 7
25. C.H. Papadimitriou, and M. Yannakakis Optimization, approximation, and complexity classes J. Comput. System Sci. 43 1991 425 440
26. C.S. Rim, and K. Nakajima On rectangle intersection and overlap graphs IEEE Trans. on Circuits and Systems 42 1995 549 553