Polynomial-time approximation schemes for geometric graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 671-679

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

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049107500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Pankaj K. Agarwal, Marc van Kreveld, Subhash Suri, Label placement by maximum independent set in rectangles, Computational Geometry: Theory and Applications, v.11 n.3-4, p.209-218, Dec. 1998
2. Brenda S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM (JACM), v.41 n.1, p.153-180, Jan. 1994 [doi>10.1145/174644.174650]
3. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27-45, 1985.
4. Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad, Graph classes: a survey, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999
5. Brent N. Clark, Charles J. Colbourn, David S. Johnson, Unit disk graphs, Discrete Mathematics, v.86 n.1-3, p.165-177, Dec. 14, 1990 [doi〉10.1016/ 0012-365X(90)90358-O]
6. Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu, Map labeling and its generalizations, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.148-157, January 05-07, 1997, New Orleans, Louisiana, United States
7. Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret, Point set labeling with specified positions, Proceedings of the sixteenth annual symposium on Computational geometry, p.182-190, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong [doi〉10.1145/336154.336200]
8. Martin Charles Golumbic, Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57), North-Holland, 2004
9. J. Hastad, Clique is hard to approximate within n1-, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.627, October 14-16, 1996
10. Johan Håstad, Some optimal inapproximability results, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.1-10, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258536]
11. Dorit S. Hochbaum, Wolfgang Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of the ACM (JACM), v.32 n.1, p.130-136, Jan. 1985 [doi〉10.1145/2455.214106]
12. Harry B. Hunt, III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, Journal of Algorithms, v.26 n.2, p.238-274, feb. 1998 [doi〉10.1006/jagm.1997.0903]
13. K. Jansen and L. Porkolab. Polynomial time approximation schemes for preemptive resource constrained scheduling and fractional weighted colorings of geometric graphs. Unpublished manuscript, 2000.
14. P. Koebe. Kontaktprobleme der konformen Abbildung. Berichte uber die Verhandlungen der Sachsischen Akademie der Wissensehaflen, Leipzig, Math.-Phys. Klasse, 88:141-164, 1936.
15. Jan Kratochvíl, Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane, Proceedings of the Symposium on Graph Drawing, p.257-270, September 18-20, 1996
16. E. Malesifiska. Graph-Theoretical Models for Frequency Assignment Problems. PhD thesis, Technische Universit/it Berlin, 1997.
17. 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.
18. T. A. McKee and F. R. McMorris. Topics in Intersection Graph Theory, volume 2 of Monographs on Discrete Mathematics and Applications. SIAM, 1999.
19. Marc van Kreveld, Tycho Strijk, Alexander Wolff, Point labeling with sliding labels, Computational Geometry: Theory and Applications, v.13 n.1, p.21-47, May 1999 [doi〉10.1016/S0925-7721(99)00005-X]
20. A. Wolff and T. Strijk. The map-labeling bibliography, 2000. http://www.math-inf.unigreifswald.de/maplabeling/bibliography/.