A faster strongly polynomial time algorithm for submodular function minimization (Q1016120)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster strongly polynomial time algorithm for submodular function minimization |
scientific article; zbMATH DE number 5550538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster strongly polynomial time algorithm for submodular function minimization |
scientific article; zbMATH DE number 5550538 |
Statements
A faster strongly polynomial time algorithm for submodular function minimization (English)
0 references
4 May 2009
0 references
For the problem of minimizing a submodular function \(f(x)\) on a finite set \(V\) a strongly polynomial oracle algorithm is suggested. The algorithm uses distance functions and exploits optimality conditions.
0 references
submodular function minimization
0 references
strongly polynomial time algorithm
0 references
0 references
0 references
0.9607586
0 references
0.9524992
0 references
0.94582963
0 references
0.94083536
0 references
0.92812616
0 references
0.9262221
0 references
0.9126524
0 references
