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

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 26-37

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Disk graphs; Fixed parameter tractable problems; Independent set

Indexed keywords

COMPUTATION THEORY; GEOMETRY; SEPARATORS;

DISK GRAPH; FIXED PARAMETER TRACTABLE PROBLEMS; GEOMETRIC SEPARATION; GEOMETRIC SEPARATORS; INDEPENDENT SET; INDEPENDENT SET PROBLEMS; PARAMETERIZED PROBLEMS; SEPARATOR THEOREMS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 1842602499     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_3     Document Type: Article

References (15)

1. Alber, J., Fernau, H., and Niedermeier R., (2001a). Graph separators: a parameterized view. In Proc. 7th COCOON 2001, pages 318-327. Springer-Verlag LNCS 2108.
2. Alber, J., Fernau, H., and Niedermeier R. (2001b). Parameterized complexity: exponential speed-up for planar graph problems. In Proc. 28th ICALP 2001, pages 261-272. Springer-Verlag LNCS 2076.
3. Cai, L. and Juedes, D. W. (2001). On the existence of subexponential parameterized algorithms. Revised version of: Subexponential parameterized algorithms collapse theW-hierarchy. In Proc. 28th ICALP 2001, pages 273-284. SpringerVerlag LNCS 2076.
4. Clark, B. N., Colbourn, C. J., and Johnson, D. S. (1990). Unit disk graphs. Discrete Math., 86(1-3):165-177.
5. Downey, R. G. and Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for W[1). Theor. Comput. Sci., 141:109-131.
6. Downey, R. G. and Fellows, M. R. (1999). Parameterized Complexity. Texts and Monographs in Computer Science. Springer-Verlag
7. Eppstein, D., Miller, G. L., and Teng, S.-H. (1993). A deterministic linear time algorithm for geometric separators and its applications. In Proc. of 9th ACM Symposium on Computational Geometry, pages 99-108.
8. Erlebach, T., Jansen, K., and Seidel, E. (2001). Polynomial-time approximation schemes for geometric graphs. In Proc. 12th ACM-SIAM SODA, pages 671-679.
9. Hochbaum, D. S. and Maass, W. (1985). Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32 (1): 130-136.
10. Hunt, H. B., Marathe, M. V., Radhakrishnan, V., Ravi, S., Rosenkrantz, D. J., and Stearns, R. E. (1998). NC-approximation schemes for NP- and PSPACEhard problems for geometric graphs. Journal of Algorithms, 26(2):238-274.
11. Impagliazzo, R., Paturi, R., and Zane, F. (1998). Which problems have strongly exponential complexity? In Proc. of the 99th IEEE FOGS, pages 653-664.
12. Koebe, P. (1936). Kontaktprobleme der konformen Abbildung. Berichte uber die Verhandlungen d. Sachs. Akad. d. Wiss. Math-Phys. Klasse, 88:141-164.
13. Lipton, R. J. and Tarjan, R. E. (1980). Applications of a planar separator theorem. SIAM Journal on Computing, 9:615-627.
14. Miller, G. L., Teng, S.-H., and Vavasis, S. A. (1991). A unified geometric approach to graph separators. In Proc. of the 92nd IEEE FOGS, pages 538-547.
15. Robson, J. M. (1986). Algorithms for maximum independent sets. Journal of Algorithms, 7:425-440.