✦ LIBER ✦

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

✍ Scribed by S. Thomas McCormick; Satoru Fujishige

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 545 KB
Volume: 122
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-008-0242-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Fully Combinatorial Algorithm for Subm

A Fully Combinatorial Algorithm for Submodular Function Minimization

✍ Satoru Iwata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.

A faster strongly polynomial time algori

A faster strongly polynomial time algorithm for submodular function minimization

✍ James B. Orlin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 212 KB