Hardness results for approximating the bandwidth

The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a distance more than b. Previous to the work reported here, it was known that it is NP-hard to approximate the bandwidth within a factor better than 3/2. We improve over this result in several respects. For certain classes of graphs (such as cycles of cliques) for which it is easy to approximate the bandwidth within a factor of 2, we show that approximating the bandwidth within a ratio better than 2 is NP-hard. For caterpillars (trees in which all vertices of degree larger than two lie on one path) we show that it is NP-hard to approximate the bandwidth within any constant, and that an approximation ratio of clogn/loglogn will imply a quasi-polynomial time algorithm for NP (when c is a sufficiently small constant).

[1]  Stephan Olariu,et al.  Asteroidal Triple-Free Graphs , 1993, SIAM J. Discret. Math..

[2]  Robert Krauthgamer,et al.  Measured Descent: A New Embedding Method for Finite Metrics , 2004, FOCS.

[3]  Dieter Kratsch,et al.  Approximating the Bandwidth for Asteroidal Triple-Free Graphs , 1999, J. Algorithms.

[4]  James B. Saxe,et al.  Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time , 1980, SIAM J. Algebraic Discret. Methods.

[5]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

[6]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Dieter Kratsch,et al.  Bandwidth of Split and Circular Permutation Graphs , 2000, WG.

[8]  Anupam Gupta.  Improved Bandwidth Approximation for Trees and Chordal Graphs , 2001, J. Algorithms.

[9]  Fillia Makedon,et al.  Bandwidth Minimization: An approximation algorithm for caterpillars , 2005, Mathematical systems theory.

[10]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

[11]  Santosh S. Vempala,et al.  On Euclidean Embeddings and Bandwidth Minimization , 2001, RANDOM-APPROX.

[12]  Aditya Shastri,et al.  Bandwidth of theta graphs with short paths , 1992, Discret. Math..

[13]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[14]  Uriel Feige,et al.  Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..

[15]  C. Pandu Rangan,et al.  On Finding the Minimum Bandwidth of Interval Graphs , 1991, Inf. Comput..

[16]  Dieter Kratsch,et al.  Approximating Bandwidth by Mixing Layouts of Interval Graphs , 1999, STACS.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Marek Karpinski,et al.  On Approximation Intractability of the Bandwidth Problem , 1997, Electron. Colloquium Comput. Complex..

[19]  Alan P. Sprague.  An 0(n log n) Algorithm for Bandwidth of Interval Graphs , 1994, SIAM J. Discret. Math..

[20]  S. Assmann,et al.  The Bandwidth of Caterpillars with Hairs of Length 1 and 2 , 1981 .

[21]  Uriel Feige,et al.  Coping with the NP-Hardness of the Graph Bandwidth Problem , 2000, SWAT.

[22]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[23]  Paul D. Seymour,et al.  Graphs with small bandwidth and cutwidth , 1989, Discret. Math..

[24]  GraphsMarek Karpinski,et al.  NP-Hardness of the Bandwidth Problem onDense , 1997 .

[25]  Uriel Feige,et al.  Approximating the Bandwidth of Caterpillars , 2005, Algorithmica.

[26]  Marek Karpinski,et al.  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs , 1997, Electron. Colloquium Comput. Complex..

[27]  James R. Lee.  Volume distortion for subsets of Euclidean spaces: extended abstract , 2006, SCG '06.

[28]  Walter Unger,et al.  The complexity of the approximation of the bandwidth problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[29]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .