A faster strongly polynomial time algorithm for submodular function minimization

We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O( n 5 EO  +  n 6 ) time, where EO is the time to evaluate f ( S ) for some . This improves the previous best strongly polynomial running time by more than...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematical programming Ročník 118; číslo 2; s. 237 - 251
Hlavný autor: Orlin, James B.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.05.2009
Springer
Springer Nature B.V
Predmet:
ISSN:0025-5610, 1436-4646
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O( n 5 EO  +  n 6 ) time, where EO is the time to evaluate f ( S ) for some . This improves the previous best strongly polynomial running time by more than a factor of n . We also extend our result to ring families.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-007-0189-2