Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

Journal of Algorithms

Volumn 52, Issue 2, 2004, Pages 134-151

  Alber, Jochen ^a   Fiala, Jiří ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Disk graphs; Graph measure; Graph separators; Independent set; Parameterized complexity

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DISK GRAPHS; GRAPH MEASURES; GRAPH SEPARATORS; SET PARAMETERIZED COMPLEXITY;

GRAPH THEORY;

EID: 3042812044     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2003.10.001     Document Type: Article

References (31)

1. J. Alber, Exact algorithms for NP -hard problems on networks: design, analysis, and implementation, PhD thesis, Univerität Tübingen, January 2003.
2. Alber J., Fernau H., Niedermeier R. Parameterized complexity: exponential speed-up for planar graph problems. Proceedings of the 28th ICALP 2001. Lecture Notes in Comput. Sci. vol. 2076:2001;261-272 Springer-Verlag. long version available as Technical Report TR01-023, Electronic Colloquium on Computational Complexity (ECCC), Trier, March 2001.
3. Alber J., Fernau H., Niedermeier R. Parameterized complexity: exponential speed-up for planar graph problems. Proceedings of the 28th ICALP 2001. Lecture Notes in Comput. Sci. vol. 2076:2001;261-272 Springer-Verlag. long version available as Technical Report TR01-023, Electronic Colloquium on Computational Complexity (ECCC), Trier, March 2001.
4. Alber J., Fernau H., Niedermeier R. Graph separators: a parameterized view. Proceedings of the 7th COCOON 2001. Lecture Notes in Comput. Sci. vol. 2108:2001;318-327 Springer-Verlag. long version available as Technical Report WSI-2001-8, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen.
5. Alber J., Fernau H., Niedermeier R. Graph separators: a parameterized view. Proceedings of the 7th COCOON 2001. Lecture Notes in Comput. Sci. vol. 2108:2001;318-327 Springer-Verlag. long version available as Technical Report WSI-2001-8, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen.
6. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. J. ACM. 41:(1):1994;153-180.
7. Bern M., Sahai A. Pushing disks together - the continuous-motion case. Discrete Comput. Geom. 20:(4):1998;499-514.
8. Cai L., Juedes D. On the existence of subexponential parameterized algorithms. Manuscript, submitted for publication, October 2001, revised version of: Subexponential parameterized algorithms collapse the W-hierarchy Proceedings 28th ICALP. Lecture Notes in Comput. Sci. vol. 2076:2001;273-284 Springer-Verlag. this conference version contains some major flaws, see [14].
9. Chan T.M. Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms. 43:2003;178-189.
10. Clark B.N., Colbourn C.J., Johnson D.S. Unit disk graphs. Discrete Math. 86:1990;165-177.
11. Djidjev H.N. On the problem of partitioning planar graphs. SIAM J. Algebr. Discrete Methods. 3:(2):1982;229-240.
12. Djidjev H.N. A separator theorem for graphs of fixed genus. Serdica. 11:1985;319-329.
13. Djidjev H.N., Venkatesan S.M. Reduced constants for simple cycle graph separation. Acta Inform. 34:1987;231-243.
14. Downey R.G., Fellows M.R. Fixed parameter tractability and completeness II: On completeness for W[1]. Theoret. Comput. Sci. 189:1995;109-131.
15. Downey R.G., Fellows M.R. Parameterized Complexity. Monogr. Comput. Sci. 1999;Springer-Verlag.
16. Downey R.G., Fellows M.R., Niedermeier R., Rossmanith P. Parameterized Complexity. Dagstuhl-Seminar-Report. vol. 316:2001.
17. Edelsbrunner H. The union of balls and its dual shape. Discrete Comput. Geom. 13:(3-4):1995;415-440.
18. Eppstein D., Miller G.L., Teng S.H. A deterministic linear time algorithm for geometric separators and its applications. Proceedings of the 9th ACM Symp. on Computational Geometry. 1993;99-108.
19. Erlebach T., Jansen K., Seidel E. Polynomial-time approximation schemes for geometric graphs. Proceedings of the 12th ACM-SIAM SODA. 2001;671-679.
20. Glasser C., Reith S., Vollmer H. The complexity of base station positioning in cellular networks. Proceedings of the ICALP 2000 Workshops. 2000;167-177 Carleton Press.
21. Hunt H.B., Marathe M.V., Radhakrishnan V., Ravi S.S., Rosenkrantz D.J., Stearns R.E. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms. 26:1998;238-274.
22. Impagliazzo R., Paturi R., Zane F. Which problems have strongly exponential complexity? Proceedings of the 39th FOCS. 1998;653-664.
23. Koebe P. Kontaktprobleme der konformen Abbildung. Ber. Verh. Saechs. Akad. Leipzig. 88:1936;141-164.
24. Lev-Tov N., Peleg D. Exact algorithms and approximation schemes for base station placement problems. Proceedings of the 8th SWAT. 2002;90-99.
25. Lipton R.J., Tarjan R.E. A separator theorem for planar graphs. SIAM J. Appl. Math. 36:(2):1979;177-189.
26. Lipton R.J., Tarjan R.E. Applications of a planar separator theorem. SIAM J. Comput. 9:(3):1980;615-627.
27. E. Malesińska, Graph-theoretical models for frequency assignment problems, PhD thesis, Technische Univerität, Berlin, 1997.
28. Miller G.L., Teng S.H., Vavasis S.A. A unified geometric approach to graph separators. Proceedings of the 32nd FOCS. 1991;538-547.
29. Miller G.L., Teng S.H., Thurston W., Vavasis S.A. Separators for sphere packings and nearest neighbor graphs. J. ACM. 44:(1):1997;1-29.
30. Robson J.M. Algorithms for maximum independent sets. J. Algorithms. 7:1986;425-440.
31. n/4), Technical Report 1251-01, Université Bordeaux, LaBRI, January 2001.