Abstract
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangement of the vertices of a caterpillar with bandwidth at most O(log n/log log n) times the local density of the caterpillar, where the local density is a well known lower bound on the bandwidth. This result is best possible in the sense that there are caterpillars whose bandwidth is larger than their local density by a factor of Ω(log n/log log n). The previous best approximation ratio for the bandwidth of caterpillars was O(log n). We show that any further improvement in the approximation ratio would require using linear arrangements that do not respect the order of the vertices of the backbone.
We also show how to obtain a (1+ε) approximation for the bandwidth of caterpillars in time \(2^{\tilde{O}(\sqrt{n/\epsilon})}\) . This result generalizes to trees, planar graphs, and any family of graphs with treewidth \(\tilde{O}(\sqrt{n})\) .
Similar content being viewed by others
References
Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical Report, University of Bonn (1997)
Chinn, P., Chvatálová, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices—survey. J. Graph. Theory 6(3), 223–254 (1982)
Chung, F.R., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discret. Math. 75, 113–119 (1989)
Dunagan, J., Vempala, S.: On Euclidean embeddings and bandwidth minimization. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM-APPROX. Lecture Notes in Computer Science, vol. 2129, pp. 229–240. Springer, New York (2001)
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: SWAT ’00: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, pp. 10–19 (2000)
Filmus, Y.: Master’s thesis, Weizmann Institute (2003)
Gupta, A.: Improved bandwidth approximation for trees and chordal graphs. J. Algorithms 40(1), 24–36 (2001)
Haralambides, J., Makedon, F., Monien, B.: Bandwidth minimization: An approximation algorithm for caterpillars. In: Mathematical Systems Theory, pp. 169–177 (1991)
Krauthgamer, R., Lee, J., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. In: FOCS ’04: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 434–443 (2004)
Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is np-complete. SIAM J. Algebr. Discret. Method. 7(4) (1986)
Saxe, J.: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebr. Discret. Method. 1, 363–369 (1980)
Unger, W.: The complexity of the approximation of the bandwidth problem. In: FOCS ’98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p. 82 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feige, U., Talwar, K. Approximating the Bandwidth of Caterpillars. Algorithmica 55, 190–204 (2009). https://doi.org/10.1007/s00453-007-9002-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9002-0