✦ LIBER ✦

Combinatorial and geometric properties of the Max-Cut and Min-Cut problems

✍ Scribed by Bondarenko, V. A.; Nikolaev, A. V.

Book ID: 121611996
Publisher: SP MAIK Nauka/Interperiodica
Year: 2013
Tongue: English
Weight: 146 KB
Volume: 88
Category: Article
ISSN: 1064-5624
DOI: 10.1134/S1064562413050062

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the min–max (regret) versi

Complexity of the min–max (regret) versions of min cut problems

✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Combinatorial Properties and the Complex

Combinatorial Properties and the Complexity of a Max-cut Approximation

✍ Charles Delorme; Svatopluk Poljak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 667 KB

We study various properties of an eigenvalue upper bound on the max-cut problem. We show that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition. It can also be adjusted for branch and bound techniques. We introduce a

A spatially continuous max-flow and min-

A spatially continuous max-flow and min-cut framework for binary labeling problems

✍ Jing Yuan, Egil Bae, Xue-Cheng Tai, Yuri Boykov 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 1009 KB

A characterization of knapsacks with the

A characterization of knapsacks with the max-flow-—min-cut property

✍ M Laurent; A Sassano 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

Examples of max-flow and min-cut problem

Examples of max-flow and min-cut problems with duality gaps in continuous networks

✍ Ryôhei Nozawa 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 968 KB

Approximation and resolution of min–max

Approximation and resolution of min–max and min–max regret versions of combinatorial optimization problems

✍ Hassene Aissi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 67 KB