Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
From MaRDI portal
Publication:4542526
DOI10.1145/276698.276717zbMath1028.68222OpenAlexW2140062802MaRDI QIDQ4542526
R. Ravi, Goran Konjevod, Avrim L. Blum, Santosh Vempala
Publication date: 29 January 2004
Published in: Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.913
Related Items
Optimization Bounds from the Branching Dual ⋮ Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems ⋮ On approximation intractability of the path-distance-width problem ⋮ Bandwidth of Bipartite Permutation Graphs in Polynomial Time ⋮ Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 ⋮ Approximating the bandwidth via volume respecting embeddings ⋮ Bandwidth of bipartite permutation graphs in polynomial time
This page was built for publication: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
