Disk graphs: A short survey

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

Volumn 2909, Issue , 2004, Pages 260-264

  Fishkin, Aleksei V ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; SENSOR NETWORKS; SURVEYS;

EUCLIDEAN PLANES; GEOMETRIC STRUCTURE; HARDNESS RESULT; INDEPENDENT SET; INTERSECTION GRAPH; ITS APPLICATIONS; LOWER AND UPPER BOUNDS; ON-LINE ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 33646969560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24592-6_23     Document Type: Article

References (22)

1. AGARWAL, P. K., OVERMARS, M., AND SHARIR, M. Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. In Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004). To appear.
2. BAKER, B. S. Approximation algorithms for np-complete problems on planar graphs. Journal of the ACM 41 (1994), 153-180.
3. BREU, H. Algorithmic Aspects of constrained unit disk graphs. PhD thesis, University of british Columbia, 1996.
4. BREU, H., AND KIRKPATRICK, D. G. Unit disc graph recognition is NP-hard. Computational Geometry: Theory and Applications 9 (1998), 3-24.
5. CLARK, B. N., COLBOURN, C. J., AND JOHNSON, D. S. Unit disk graphs. Discrete Mathematics 86 (1990), 165-177.
6. ERLEBACH, T., AND FIALA, J. Independence and coloring problems on intersection graphs of disks, manuscript, 2001.
7. ERLEBACH, T., AND FIALA, J. On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications 23, 2 (2002), 243-255.
8. ERLEBACH, T., JANSEN, K., AND SEIDEL, E. Polynomial-time approximation schemes for geometric graphs. In Proceedings the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA'01) (Washington, DC, 7-9 2001), pp. 671-679.
9. FIALA, J., FISHKIN, A. V., AND FOMIN, F. Off-line and on-line distance constrained labeling of disk graphs. In Proceedings 9th Annual European Symposium on Algorithms (Arhus, 2001), LNCS 2161, pp. 464-475.
10. GRAF, A., STUMPF, M., AND WEISENFELS, G. On coloring unit disk graphs. Algorithmica 20, 3 (1998), 277-293.
11. GYÁRFÁS, A., AND LEHEL, J. On-line and first fit colorings of graphs. Journal of Graph Theory 12 (1988), 217-227.
12. HLINẼNÝ, P., AND KRATOCHVÍL, J. Representing graphs by disks and balls. Discrete Mathematics 229 (2001), 101-124.
13. HOCHBAUM, D., AND MAASS, W. Approximation schemes for covering and packing problems in image processing and vlsi. Journal of the ACM 32 (1985), 130-136.
14. HUNTIII, H. B., MARATHE, M. V., RADHAKRISHNAN, V., RAVI, S. S., ROSENKRANTZ, D. J., AND STEARNS, R. E. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algorithms 26, 2 (1998), 238-274.
15. KOEBE, P. Kontaktprobleme der konformen Abbildung. In Math.-Phys. Klasse, vol. 88. Berichte Verhande. Saechs. Akad. Wiss. Leipzig, 1936, pp. 141-164.
16. MALESIŃSKA, E. Graph theoretical models for frequency assignment problems. PhD thesis, Technical University of Berlin, Germany, 1997.
17. MARATHE, M. V., BREU, H., HUNT III, H. B., RAVI, S. S., AND ROSENKRANTZ, D. J. Simple heuristics for unit disk graphs. Networks 25 (1995), 59-68.
18. MATSUI, T. Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In Proceedings The Japan Conference on Discrete and Computational Geometry (1998), LNCS 1763, Springer Verlag, pp. 194-200.
19. PEETERS, R. On coloring j-unit sphere graphs. Tech. rep., Department of Economics, Tilburg University, 1991.
20. RAGHAVAN, V., AND SPINRAD, J. Robust algorithms for restricted domains. Journal of Algorithms 48(1) (2003), 160-172.
21. WANG, D., AND KUO, Y.-S. A study on two geometric location problems. Information Processing Letters 28 (1988), 281-286.
22. Y.-T. TSAI, Y.-L. LIN, F. H. The online firstfit algorithm for radio frequency assignment problems. Information Processing Letters 84, 4 (2002), 195-199.