✦ LIBER ✦

New algorithms for the weighted maximum cut problem on graphs

✍ Scribed by N. Z. Shor; O. A. Berezovskii

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition algorithms for the maximum

✍ Heungsoon Felix Lee; Daniel R. Dooly 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

A New Algorithm for the Maximum-Weight C

✍ Patric R.J. Östergård 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 72 KB

A new scaling algorithm for the maximum

✍ Kazuo Iwano; Shinji Misono; Shu Tezuka; Satoru Fujishige 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 673 KB

Sequential and parallel algorithms for t

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A new polynomial-time algorithm for the

✍ A. Hertz 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 363 KB

A new—old algorithm for minimum-cut and

✍ Dorit S. Hochbaum 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB