The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
Average case complete problems
SIAM Journal on Computing
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
Graphs with small bandwidth and cutwidth
Discrete Mathematics
Computing the bandwidth of interval graphs
SIAM Journal on Discrete Mathematics
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Coloring random and semi-random k-colorable graphs
Journal of Algorithms
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Heuristics for semirandom graph problems
Journal of Computer and System Sciences
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Which Problems Have Strongly Exponential Complexity?
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
On Limited versus Polynomial Nondeterminism
On Limited versus Polynomial Nondeterminism
Algorithmic number theory-the complexity contribution
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Graph-Theoretic Concepts in Computer Science
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms
Exact and approximate bandwidth
Theoretical Computer Science
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
An exact algorithm for minimum distortion embedding
Theoretical Computer Science
Capacitated domination faster than O(2n)
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Bandwidth and distortion revisited
Discrete Applied Mathematics
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Capacitated domination faster than O(2n)
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Irredundant set faster than O(2n)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.00 |
We review several approaches of coping with NP-hardness, and see how they apply (if at all) to the problem of computing the bandwidth of a graph.