Max Cut
Publisher
Springer New York
Reference35 articles.
1. Andersson G, Engebretsen L, Håstad J (2001) A new way to use semidefinite programming with applications to linear equations mod p. J Algorithms 39:162–204
2. Arora S, Rao S, Vazirani U (2004) Expander flows, geometric embeddings and graph partitioning. In: Proceedings of the 36th annual symposium on the theory of computing (STOC), Chicago, pp 222–231
3. Barahona F (1993) On cuts and matchings in planar graphs. Math Program 60:53–68
4. Blum A, Konjevod G, Ravi R, Vempala S (2000) Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor Comput Sci 235:25–42
5. Charikar M, Guruswami V, Wirth A (2003) Clustering with qualitative information. In: Proceedings of the 44th annual IEEE symposium on foundations of computer science (FOCS), Boston, pp 524–533