Independence and coloring problems on intersection graphs of disks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3484 LNCS, Issue , 2006, Pages 135-155

  Erlebach, Thomas ^a   Fiala, Jiří ^b  

^a ETH ZURICH   (Switzerland)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

COLORING PROBLEMS; ON-LINE ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 34548490011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671541_5     Document Type: Article

References (34)

1. C. Ambühl and U. Wagner. On the clique problem in intersection graphs of ellipses. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 2518, pages 489-500, 2002.
2. E. Asplund and B. Grünbaum. On a coloring problem. Mathematica Scandinavica, 8:181-188, 1960.
3. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180, 1994.
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, pages 427-436, 2001.
5. H. Breu and D. G. Kirkpatrick. On the complexity of recognizing intersection and touching graphs of disks. In Proceedings of the Symposium on Graph Drawing (GD'95), Lecture Notes in Computer Science 1027, pages 88-98, 1996.
6. H. Breu and D. G. Kirkpatrick. Unit disk graph recognition is NP-hard. Computational Geometry: Theory and Applications, 9(1-2):3-24, 1998.
7. T. M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms, 46:178-189, 2003.
8. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86(1-3):165-177, 1990.
9. T. Erlebach and J. Fiala. On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications, 23(2):243-255, 2002.
10. T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'01, pages 671-679, 2001.
11. J. Fiala, A. V. Fishkin, and F. V. Fomin. Off-line and on-line distance constrained labeling of graphs. In Proceedings of the 9th European Symposim on Algorithms (ESA '01), Lecture Notes in Computer Science 2161, pages 464-475. Springer Verlag, 2001.
12. A. Gräf. Coloring and recognizing special graph classes. Musikinformatik und Medientechnik Bericht 20/95, Johannes Gutenberg- Universität Mainz, 1995.
13. A. Gräf, M. Stumpf, and G. Weißenfels. On coloring unit disk graphs. Algorithmica, 20(3):277-293, 1998. See also Musikinformatik und Medientechnik Bericht 17/94, Johannes Gutenberg-Universität Mainz, 1994.
14. A. Gyárfás and J. Lehel. On-line and first fit colourings of graphs. Jornal of Graph Theory, 12(2):217-227, 1988.
15. W. K. Hale. Frequency assignment: Theory and applications. Proc. of the IEEE, 68(12):1497-1514, 1980.
16. M. M. Halldórsson. Approximating discrete collections via local improvements. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 160-169, 1995.
17. P. Hliněný and J. Kratochvíl. Representing graphs by disks and balls. Discrete Mathematics, 229(1-3):101-124, 2001.
18. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
19. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32(1):130-136, 1985.
20. 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. Journal of Algorithms, 26(2):238-274, 1998.
21. S. Irani. Coloring inductive graphs on-line. Algorithmica, 11:53-72, 1994.
22. K. Jansen. Approximate strong separation with application in fractional graph coloring and preemptive scheduling. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02), Lecture Notes in Computer Science 2285, pages 100-111, 2002.
23. K. Jansen and L. Porkolab. On preemptive resource constrained scheduling: Polynomial-time approximation schemes. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference (IPCO'02), Lecture Notes in Computer Science 2337, pages 329-349, 2002.
24. P. Koebe. Kontaktprobleme der konformen Abbildung. Ber. Verh. Sachs. Akad. Leipzig, 88:141-164, 1936.
25. J. Kratochvíl. A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics, 52:233-252, 1994.
26. E. Malesińska. Graph theoretical models for frequency assignment problems. PhD thesis, Technical University of Berlin, 1997.
27. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
28. T. Matsui. Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In Discrete and Computational Geometry, Lecture Notes in Computer Science 1763, pages 194-200, 2000.
29. T. Nieberg, J. Hurink, and W. Kern. A robust PTAS for maximum weight 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 Computer Science 3353, pages 214-221, 2004.
30. R. Peeters. On coloring j-unit sphere graphs. Technical report, Dept. of Economics, Tilburg University, 1991.
31. V. Raghavan and J. Spinrad. Robust algorithms for restricted domains. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01 ), pages 460-467, 2001.
32. H. Sachs. Coin graphs, polyhedra, and conformal mapping. Discrete Mathematics, 134:133-138, 1994.
33. D. Wang and Y.-S. Kuo. A study on two geometric location problems. Information Processing Letters, 28:281-286, 1988.
34. A. Wolff and T. Strijk. The map-labeling bibliography, http://i11www.ira.uka.de/map-labeling/bibliography/.