Submodular function minimization and related topics

It had been a long-standing open problem to devise a combinatorial polynomial algorithm for minimizing submodular functions. Iwata-Fleischer-Fujishige (IFF) and Schrijver resolved the problem independently and simultaneously. The present article is basically a survey, though not comprehensive, on su...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization methods & software Ročník 18; číslo 2; s. 167 - 180
Hlavný autor: Fujishige, Satoru
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Taylor & Francis Group 01.04.2003
Predmet:
Combinatorial Algorithm
Polynomial Algorithm
Submodular Function
ISSN:1055-6788, 1029-4937
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:It had been a long-standing open problem to devise a combinatorial polynomial algorithm for minimizing submodular functions. Iwata-Fleischer-Fujishige (IFF) and Schrijver resolved the problem independently and simultaneously. The present article is basically a survey, though not comprehensive, on submodular function minimization algorithms and also describes additional results and research subjects. In this article we first give an outline of the IFF algorithm and then show two modifications of the original IFF algorithm, which seem to be promising in practical implementation. We also describe a brief history of developments in submodular function minimization. Finally, we furnish some possible future research subjects in submodular function minimization.
ISSN:1055-6788
1029-4937
DOI:10.1080/1055678031000081447