Faster exact bandwidth

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

Volumn 5344 LNCS, Issue , 2008, Pages 101-109

  Cygan, Marek ^a   Pilipczuk, Marcin ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; TECHNICAL PRESENTATIONS; TELECOMMUNICATION SYSTEMS;

EXACT ALGORITHMS; EXHAUSTIVE SEARCHES; EXPONENTIAL TIMES; LONG TIMES; NP-HARD PROBLEMS; TIME ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 58349091989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_10     Document Type: Conference Paper

References (9)

1. Assman, S., Peck, G., Syslo, M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM J. Algebraic Discrete Methods 2, 387-393 (1981)
2. Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: Hardness for the w hierarchy (extended abstract). ACM Symposium on Theory of Computing, 449-458 (1994)
3. Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60(3), 510-539 (2000)
4. Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 10-19. Springer, Heidelberg (2000)
5. Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477-495 (1978)
6. Kleitman, D., Vohra, R.: Computing the bandwidth of interval graphs. SIAM J. Discrete Math. 3, 373-375 (1990)
7. Monien, B.: The bandwidth-minimization problem for caterpillars with hairlength 3 is np-complete. SIAM J. Algebraic Discrete Methods 7, 505-512 (1986)
8. Saxe, J.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM Journal on Algebraic Methods 1, 363-369 (1980)
9. Unger, W.: The complexity of the approximation of the bandwidth problem. In: FOCS, pp. 82-91 (1998)