Computing the independence number of intersection graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1161-1165

  Fox, Jacob ^a   Pach, János ^b  

^a Princeton ^*  (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; MAPS; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; COMPUTATIONAL CARTOGRAPHY; FREQUENCY ASSIGNMENTS; INDEPENDENCE NUMBER; INTERSECTION GRAPH; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; SUBEXPONENTIAL TIME;

GRAPH THEORY;

EID: 79955728653     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.87     Document Type: Conference Paper

References (32)

1. P.K. Agarwal, M. van Kreveld, and S. Suri, Label placement by maximum independent set in rectangles, Comput. Geom. 11 (1998), 209-218. (Pubitemid 128431619)
2. P. K. Agarwal and N. H. Mustafa, Independent set of intersection graphs of convex objects in 2D, Comput. Geom. 34 (2006), 83-95.
3. K. Appel, W. Haken, and J. Koch, Every planar map is four colorable, Illinois J. Math. 21 (1977), 439-567.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J. ACM 45 (1998), 501-555. (Pubitemid 128506634)
5. S. Arora and S. Safra, Probabilistic checking of proofs: a new characterization of NP, J. ACM 45 (1998). 70-122. (Pubitemid 128615465)
6. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994), 153-180.
7. S. Benzer, On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. 45 (1959), 1607-1620.
8. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990), 165-177.
9. G. Even, Z. Lotker, D. Ron, and S. Smorodinsky, Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM J. Computing 33 (2003), 94-136.
10. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Interactive proofs and the hardness of approximating cliques, J. ACM 43 (1996), 268-292.
11. L. de Floriani, P. Magillo, and E. Puppo, Applications of computational geometry to geographic information systems, Chapter 7 in: Handbook of Computational Geometry (J. Sack, J. Urrutia, eds.), North-Holland, Amsterdam, 2000, 333-383.
12. J. Fox and J. Pach, Separator theorems and Turán-type results for planar intersection graphs, Advances in Mathematics 219 (2008), 1070-1080.
13. J. Fox and J. Pach, String graphs and incomparability graphs, submitted.
14. J. Fox and J. Pach, A separator theorem for string graphs and its application, Combin. Probab. Comput. 19 (2010), 371-390.
15. J. Fox, J. Pach, and C. D. Tóth, Intersection patterns of curves, J. London Math. Soc., to appear.
16. J. Håstad, Clique is hard to approximate within n1-ε, Acta Math. 182 (1999), 105-142.
17. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM 32 (1985), 130-136. (Pubitemid 15599048)
18. J. Kara and J. Kratochvil, Fixed parameter tractability of independent set in segment intersection graphs, in: 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Comput. Sci. 4169, Springer, Berlin, 2006, 166-174. (Pubitemid 44609921)
19. R. Karp, Redueibility among combinatorial problems, in Complexity of Computer Computations (R.E. Miller and J. W. Thatcher, eds.), Plenum, New York, 1972, 85-103.
20. P. Koebe, Kontaktprobleme der Konformen Abbildung, Ber. Sachs. Akad. Wiss. Leipzig, Math.-Phys. Kl. 88 (1936), 141-164.
21. J. Kratochvil and J. Nesetril, INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs, Comment. Math. Univ. Carolin. 31 (1990), 85-93.
22. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177-189.
23. R. J. Lipton and R. E. Tarjain, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980), 615-627.
24. E. Malesinska, Graph-Theoretical Models for Frequency Assignment Problems, Ph.D. Thesis, Technische Universität Berlin, 1997.
25. D. Marx, Parameterized complexity of independence and domination on geometric graphs, in: 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Comput. Sci. 4169, Springer, Berlin, 2006, 154-165. (Pubitemid 44609920)
26. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis, Separators for sphere-packings and nearest neighbor graphs, J. ACM 44 (1997), 1-29. (Pubitemid 127617696)
27. F. Preparata and M. Shamos, Computational Geometry: An Introduction, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1985.
28. M. Schaefer, E. Sedgwick, and D. Štefankovič, Recognizing string graphs in NP, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2002, 1-6. (Pubitemid 35009354)
29. F. W. Sinden, Topology of thin film RC-circuits, Bell System Technological Journal (1966), 1639-1662.
30. F. Spieksma, Approximating an interval scheduling problem, in: Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX.98), Lecture Notes in Computer Science, vol. 1444, Springer, Berlin, 1998, 169-180. (Pubitemid 128104539)
31. B. Verweij and K. Aardal, An optimisation algorithm for maximum independent set with applications in map labelling, in: Proceedings of the Seventh Annual European Symposium on Algorithms (ESA.99), Lecture Notes in Computer Science, vol. 1643, Springer, Berlin, 1999, 426-437.
32. D. Zuckerman, Linear degree extractors and the in-approximability of max clique and chromatic number, Theory Comput. 3 (2007), 103-128.