Approximation algorithms for the bandwidth minimization problem for a large class of trees

Theory of Computing Systems

Volumn 30, Issue 1, 1997, Pages 67-90

  Haralambides, J ^a   Makedon, F ^b  

^a BARRY UNIVERSITY   (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BANDWIDTH; FORESTRY;

BALANCED TREES; BANDWIDTH MINIMIZATION PROBLEM; MULTI PROCESSOR SCHEDULING; NODE DEGREE; OPTIMAL ALGORITHM; SUBTREES; TREE NODES; VLSI LAYOUT;

TREES (MATHEMATICS);

EID: 0031476959     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679454     Document Type: Article

References (17)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. S. Bhatt and S. Cosmadakis. The complexity of minimizing wire lengths in VLSI layouts. Manuscript. Laboratory for Computer Science, MIT, Cambridge, MA, 1983.
3. S. N. Bhatt and C. E. Leiserson. Minimizing the longest edge in a VLSI layout. VLSI Memo, MIT, pages 82-86, 1982.
4. K. Y. Cheng. Minimizing the bandwidth of sparse symmetric matrices. Journal of Computing, vol. 11, pages 103-110, 1973.
5. J. Chvátalová. On the bandwidth problem for graphs. PhD Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1980.
6. P. Z. Chinn, J. Chvátalová, A. K. Dewdney, and N. E. Gibbs: The bandwidth problem for graphs and matrices-A survey. Journal of Graph Theory, vol. 6, pages 223-254, 1982.
7. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. Proceedings of the 24th ACM National Conference, pages 157-172, 1969.
8. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth. Complexity results for bandwidth minimization. SIAM Journal of Applied Mathematics, vol. 34, pages 477-495, 1978.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Thory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
10. E. M. Gurari and I. H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problems. Journal of Algorithms, vol. 5, pages 531-546, 1984.
11. J. Haralambides, F. Makedon, and B. Monien. Bandwidth minimization: An approximation algorithm for caterpillars. Journal of Mathematical Systems Theory, vol. 24, pages 169-177, 1991.
12. J. Haralambides, F. Makedon and B. Monien. Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. Proceedings of the 2nd Parallel and Distributed Processing Conference, pages 301-307, 1990.
13. B. Monien. The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete. SIAM Journal on Algebraic and Discrete Methods, vol. 7, pages 505-512, 1986.
14. F. S. Makedon and I. H. Sudborough. On minimizing width in linear layouts. Proceedings of the 10th International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 154. Springer-Verlag, Berlin, 1983.
15. C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Journal of Computing, vol. 16, pages 263-270, 1976.
16. J. B. Saxe. Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM Journal on Algebraic and Discrete Methods, vol. 1. pages 363-369, 1980.
17. J. Turner. Bandwidth and probabilistic complexity. PhD Thesis, Northwestern University, 1982.