Improved Bandwidth Approximation for Trees and Chordal Graphs

Journal of Algorithms

Volumn 40, Issue 1, 2001, Pages 24-36

  Gupta, Anupam ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344359893     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1118     Document Type: Article

References (28)

1. I. Anderson, A variance method in combinatorial number theory, Glasgow Math. J. 10 (1969), 126-129.
2. S. F. Assmann, G. W. Peck, M. M. Sysło, and J. Zak, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebraic Discrete Methods 2 (1981), 387-393.
3. A. Blum, G. Konjevod, R. Ravi, and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing," pp. 100-105, 1998.
4. H. L. Bodlaender, M. R. Fellows, and M. T. Hallett. Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy (extended abstract), in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing," pp. 449-458, 1994.
5. A. Brandstädt, V. Chepoi, and F. Dragan, Distance approximating trees for chordal and dually chordal graphs, J. Algorithms 30 (1999), 166-184.
6. P. Buneman, A characterisation of rigid circuit graphs, Discrete Math. 9 (1974), 205-212.
7. G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961), 71-76.
8. U. Feige, Approximating the bandwidth via volume respecting embeddings, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing," pp. 90-99, 1998.
9. U. Feige, Improved analysis of the volume distortion of the random subsets embedding, Manuscript, October 28, 1998.
10. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978), 477-495.
11. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
12. A. Gupta, Embedding trees into low dimensional Euclidean spaces, Discrete Comput. Geom. 24 (2000), 105-116.
13. A. Gupta, Improved bandwidth approximation for trees, in "Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 788-793, 2000.
14. E. M. Gurari and I. Hal Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem, J. Algorithms 5 (1984), 531-546.
15. J. Haralambides and F. Makedon, Approximation algorithms for the bandwidth minimization problem for a large class of trees, Theory Comput. System 30 (1997), 67-90.
16. J. Haralambides, F. Makedon, and B. Monien, Bandwidth minimization: an approximation algorithm for caterpillars, Math. Systems Theory 24 (1991), 169-177.
17. D. J. Kleitman and R. V. Vohra, Computing the bandwidth of interval graphs, SIAM J. Discrete Math. 3 (1990), 373-375.
18. T. Kloks, D. Kratsch, and H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, J. Algorithms 32 (1999), 41-57.
19. D. Kratsch and L. Stewart, Approximating bandwidth by mixing layouts of interval graphs in "Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS '99)" (C. Meinel and S. Tison, Eds.), Lecture Notes in Computer Science, Vol. 1563 pp. 248-258, Springer-Verlag, Berlin/New York, 1999.
20. I. Leader and A. J. Radcliffe, Littlewood-Offord inequalities for random variables, SIAM J. Discrete Math. 1 (1994), 90-101.
21. N. Linial, A. Magen, and M. Saks, Trees and Euclidean metrics, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing," pp. 169-177, 1998.
22. J. Matoušek, On embedding trees into uniformly convex Banach spaces, Israel J. Math. 114 (1999), 221-237. [Czech version in "Lipschitz Distance of Metric Spaces," C.Sc. degree thesis, Charles University, 1990].
23. J. Matoušek, On embedding trees into uniformly convex Banach spaces, Israel J. Math. 114 (1999), 221-237. [Czech version in "Lipschitz Distance of Metric Spaces," C.Sc. degree thesis, Charles University, 1990].
24. B. Monien, The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete, SIAM J. Algebraic Discrete Methods 7 (1986), 505-512.
25. C. H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976), 263-270.
26. Y. Rabinovich and R. Raz, Lower bounds on the distortion of embedding finite metric spaces in graphs, Discrete Comput. Geom. 19 (1998), 79-94.
27. S. B. Rao, Small distortion and volume preserving embeddings for planar and Euclidean metrics, in "15th Annual ACM Symposium on Computational Geometry," pp. 300-306, 1999.
28. W. Unger, The complexity of the approximation of the bandwidth problem, in "Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science," pp. 82-91, 1998.