✦ LIBER ✦

Minimizing a sum of submodular functions

✍ Scribed by Vladimir Kolmogorov

Book ID: 116401294
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 423 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.05.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing symmetric submodular function

Minimizing symmetric submodular functions

✍ Maurice Queyranne 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 669 KB

Submodular function minimization

✍ Satoru Iwata 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 302 KB

Minimizing submodular functions over fam

Minimizing submodular functions over families of sets

✍ M. X. Goemans; V. S. Ramakrishnan 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 793 KB

A Faster Scaling Algorithm for Minimizin

A Faster Scaling Algorithm for Minimizing Submodular Functions

✍ Iwata, Satoru 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 134 KB

On submodular function minimization

✍ William H. Cunningham 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 492 KB

A Combinatorial Algorithm Minimizing Sub

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

✍ Alexander Schrijver 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle c