Approximation algorithms for the bandwidth minimization problem for a large class of trees
From MaRDI portal
Publication:675856
DOI10.1007/BF02679454zbMath0870.68078MaRDI QIDQ675856
Publication date: 7 September 1997
Published in: Theory of Computing Systems (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Cites Work
- The complexity of minimizing wire lengths in VLSI layouts
- The NP-completeness of the bandwidth minimization problem
- Minimizing the bandwidth of sparse symmetric matrices
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- The bandwidth problem for graphs and matrices—a survey
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Bandwidth Minimization: An approximation algorithm for caterpillars
- Complexity Results for Bandwidth Minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item