Approximating the bandwidth of caterpillars

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 62-73

  Feige, Uriel ^a   Talwar, Kunal ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; GRAPH THEORY; LINEAR SYSTEMS; POLYNOMIALS;

LINEAR ARRANGEMENT; LOCAL DENSITY; PLANAR GRAPHS; POLYNOMIAL TIME ALGORITHM;

APPROXIMATION THEORY;

EID: 26944479270     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_6     Document Type: Conference Paper

References (14)

1. G. Blache, M. Karpinski, and J. Wirtgen. On approximation intractability of the bandwidth problem. Technical report, University of Bonn, 1997.
2. P. Chinn, J. Chvatálová, A. Dewdney, and N. Gibbs. The bandwidth problem for graphs and matrices - survey. Journal of Graph Theory, 6(3):223-254, 1982.
3. F. R. Chung and P. D. Seymour. Graphs with small bandwidth and cutwidth. Discrete Mathematics, 75:113-119, 1989.
4. J. Dunagan and S. Vempala. On euclidean embeddings and bandwidth minimization. In APPROX '01/RANDOM '01, pages 229-240, 2001.
5. U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci., 60(3):510-539, 2000.
6. U. Feige. Coping with the NP-hardness of the graph bandwidth problem. In SWAT, pages 10-19, 2000.
7. Y. Filmus. Master's thesis, Weizmann Institute, 2003.
8. A. Gupta. Improved bandwidth approximation for trees. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 788-793, 2000.
9. J. Haralambides, F. Makedon, and B. Monien. Bandwidth minimization: An approximation algorithm for caterpillars. Mathematical Systems Theory, pages 169-177, 1991.
10. R. Krauthgamer, J. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In FOCS, pages 434-443, 2004.
11. B. Monien. The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods, 7(4):505-512, 1986.
12. C. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16:263-270, 1976.
13. J. Saxe. Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discrete Methods, 1:363-369, 1980.
14. W. Unger. The complexity of the approximation of the bandwidth problem. In FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 82-91, 1998.