Polynomial-time approximation schemes for geometric intersection graphs

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1302-1323

  Erlebach, Thomas ^a   Jansen, Klaus ^b   Seidel, Eike ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Disk graph; Independent set; Shifting strategy; Vertex cover

Indexed keywords

GEOMETRY; GRAPH THEORY; MATHEMATICAL INSTRUMENTS; MATHEMATICAL TECHNIQUES; OPTIMIZATION;

DISK GRAPH; INDEPENDENT SET; SHIFTING STRATEGY; VERTEX COVER;

POLYNOMIAL APPROXIMATION;

EID: 29344432647     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702402676     Document Type: Article

References (28)

1. P. K. AGARWAL, M. VAN KREVELD, AND S. SURI, Label placement by maximum independent set in rectangles, Comput. Geom. 11 (1998), pp. 209-218.
2. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
3. R. BAR-YEHUDA AND S. EVEN, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math., 25 (1985), pp. 27-45.
4. P. BERMAN, B. DASGUPTA, S. MUTHUKRISHNAN, AND S. RAMASWAMI, Improved approximation algorithms for rectangle tiling and packing, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), ACM, New York, SIAM, Philadelphia, 2001, pp. 427-436.
5. A. BRANDSTÄDT, On robust algorithms for the maximum weight stable set problem, in Proceedings of the 13th International Symposium on Fundamentals of Computation Theory (FCT 2001), Lecture Notes in Comput. Sci. 2138, Springer-Verlag, Berlin, 2001, pp. 445-458.
6. A. BRANDSTÄDT, V. B. LE, AND J. P. SPINRAD, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, 1999.
7. H. BREU AND D. G. KIRKPATRICK, Unit disk graph recognition is NP-hard, Comput. Geom. 9 (1998), pp. 3-24.
8. T. M. CHAN, Polynomial-time approximation schemes for packing and piercing fat objects, J. Algorithms, 46 (2003), pp. 178-189.
9. B. N. CLARK, C. J. COLBOURN, AND D. S. JOHNSON, Unit disk graphs, Discrete Math., 86 (1990), pp. 165-177.
10. S. DODDI, M. V. MARATHE, A. MIRZAIAN, B. M. E. MORET, AND B. ZHU, Map labeling and its generalizations, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), ACM, New York, SIAM, Philadelphia, 1997, pp. 148-157.
11. S. DODDI, M. V. MARATHE, AND B. M. E. MORET, Point set labeling with specified positions, Internat. J. Comput. Geom. Appl., 12 (2002), pp. 29-66.
12. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. W. K. HALE, Frequency assignment: Theory and applications, Proceedings of the IEEE, 68 (1980), pp. 1497-1514.
14. 1-ε, Acta Math., 182 (1999), pp. 105-142.
15. J. HÅSTAD, Some optimal inapproximability results, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC'97), ACM Press, New York, 1997, pp. 1-10.
16. P. HLINĚNÝ AND J. KRATOCHVÍL, Representing graphs by disks and balls, Discrete Math., 229 (2001), pp. 101-124.
17. D. S. HOCHBAUM AND W. MAASS, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM, 32 (1985), pp. 130-136.
18. H. B. HUNT III, 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), pp. 238-274.
19. K. JANSEN, Approximate strong separation with application in fractional graph coloring and preemptive scheduling, Theoret. Comput. Sci., 302 (2003), pp. 239-256.
20. K. JANSEN AND L. PORKOLAB, On preemptive resource constrained scheduling: Polynomial-time approximation schemes, in Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Comput. Sci. 2337, Springer-Verlag, Berlin, 2002, pp. 329-349.
21. P. KOEBE, Kontaktprobleme der konformen Abbildung, Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften, Leipzig, Math.-Phys. Klasse, 88 (1936), pp. 141-164.
22. E. MALESIŃSKA, Graph-Theoretical Models for Frequency Assignment Problems, Ph.D. thesis, Technische Universität Berlin, Berlin, Germany, 1997.
23. M. V. MARATHE, H. BREU, H. B. HUNT III, S. S. RAVI, AND D. J. ROSENKRANTZ, Simple heuristics for unit disk graphs, Networks, 25 (1995), pp. 59-68.
24. T. A. MCKEE AND F. R. MCMORRIS, Topics in Intersection Graph Theory, SIAM Monogr. Discrete Math. Appl. 2, SIAM, Philadelphia, 1999.
25. T. NIEBERG, J. L. HURINK, AND W. KERN, A robust PTAS for maximum independent sets in unit disk graphs, in Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04), Lecture Notes in Comput. Sci. 3353, Springer-Verlag, New York, 2004, pp. 214-221.
26. V. RAGHAVAN AND J. SPINRAD, Robust algorithms for restricted domains, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), ACM, New York, SIAM, Philadelphia, 2001, pp. 460-467.
27. M. VAN KREVELD, T. STRIJK, AND A. WOLFF, Point labeling with sliding labels, Comput. Geom., 13 (1999), pp. 21-47.
28. A. WOLFF AND T. STRIJK, The map-labeling bibliography, http://illwww.ilkd.uni-karlsruhe.de/~awolff/map-labeling/bibliography/ (2003).