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ženo v:
Podrobná bibliografie
Vydáno v:Optimization methods & software Ročník 18; číslo 2; s. 167 - 180
Hlavní autor: Fujishige, Satoru
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.04.2003
Témata:
Combinatorial Algorithm
Polynomial Algorithm
Submodular Function
ISSN:1055-6788, 1029-4937
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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