The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs
SIAM Journal on Discrete Mathematics
Information Processing Letters
Approximating the bandwidth via volume respecting embeddings
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Approximating layout problems on random geometric graphs
Journal of Algorithms
Improved bandwidth approximation for trees and chordal graphs
Journal of Algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
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
Multilevel bandwidth and radio labelings of graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Hi-index | 0.00 |
Graph bandwidth minimization (GBM) is a classical and challenging problem in graph algorithms and combinatorial optimization. Most of existing researches on this problem have focused on unweighted graphs. In this paper, we study the bandwidth minimization problem of weighted caterpillars, and propose several algorithms for solving various types of caterpillars and general graphs. More specifically, we show that the GBM problem on caterpillars with hair-length at most 2 and the GBM problem on star-shape caterpillars are NP-complete, and give a lower bound of the graph bandwidth for general weighted graphs. For caterpillars with hair-length at most 1, we present an O(n log n log(nwmax))-time algorithm to compute an optimal bandwidth layout, where n is the total number of vertices in the graph and wmax is the maximum wedge weight. For caterpillars with hair-length at most k, we give a k-approximation algorithm. For arbitrary caterpillars and general graphs, we give a heuristic algorithm and some experimental results. Experiments show that the solutions obtained by our heuristic algorithm are roughly within a factor of clog(n) of the lower bound for a small number c, which is consistent with the inapproximability results of this problem (i.e., no constant approximation for the GBM problem unless P = NP).