Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

We present simple semidefinite programming relaxations for the m-hard minimum bandwidth and minimum length linear ordering problems. We then show how these relaxations can be rounded in a natural way (via random projection) to obtain new approximation guarantees for both of these vertex-ordering problems.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[3]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[5]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[6]  Santosh S. Vempala,et al.  Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems , 2000, Theor. Comput. Sci..

[7]  Uriel Feige,et al.  Approximating the bandwidth via volume respecting embeddings (extended abstract) , 1998, STOC '98.

[8]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

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

[10]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

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

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

[13]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[14]  V. Chvátal,et al.  A remark on a problem of Harary , 1970 .

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

[16]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 2000, JACM.