Abstract
We deal with exact algorithms for Bandwidth, a long studied NP-hard problem. For a long time nothing better than the trivial O *(n!) exhaustive search was known. In 2000, Feige an Kilian [4] came up with a O *(10n)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved.
In this paper we present a new and quite simple O *(5n) algorithm. We also obtain even better bound in some special cases.
We would like to thank INFO.RO for sponsoring the WG 2008 Best Student Paper Award that has been awarded to this paper.
This research is partially supported by a grant from the Polish Ministry of Science and Higher Education, project N206 005 32/0807.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60(3), 510–539 (2000)
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)
Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477–495 (1978)
Kleitman, D., Vohra, R.: Computing the bandwidth of interval graphs. SIAM J. Discrete Math. 3, 373–375 (1990)
Monien, B.: The bandwidth-minimization problem for caterpillars with hairlength 3 is np-complete. SIAM J. Algebraic Discrete Methods 7, 505–512 (1986)
Saxe, J.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM Journal on Algebraic Methods 1, 363–369 (1980)
Unger, W.: The complexity of the approximation of the bandwidth problem. In: FOCS, pp. 82–91 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cygan, M., Pilipczuk, M. (2008). Faster Exact Bandwidth. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-92248-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92247-6
Online ISBN: 978-3-540-92248-3
eBook Packages: Computer ScienceComputer Science (R0)