✦ LIBER ✦

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

✍ Scribed by Alexander Schrijver

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 108 KB
Volume: 80
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1989

No coin nor oath required. For personal study only.

✦ Synopsis

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 calls is bounded by a polynomial in the size of the underlying set.

📜 SIMILAR VOLUMES

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.