✦ LIBER ✦

Node and edge relaxations of the Max-cut problem

✍ Scribed by S. Poljak; F. Rendl

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Tight Semidefinite Relaxation of the M

✍ Hongwei Liu; Sanyang Liu; Fengmin Xu 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 66 KB

Exploring the Relationship Between Max-C

✍ Monia Giandomenico; Adam N. Letchford 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 194 KB

Connections between semidefinite relaxat

✍ Monique Laurent; Svatopluk Poljak; Franz Rendl 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 914 KB

Weakly bipartite graphs and the Max-cut

✍ M. Grötschel; W.R. Pulleyblank 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Optimization and optimality test for the

✍ Chr Hohmann; W. Kern 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 510 KB

Approximation bounds for quadratic maxim

✍ Da-chuan Xu; Shu-zhong Zhang 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 249 KB