A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505)
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 combinatorial algorithm minimizing submodular functions in strongly polynomial time. |
scientific article; zbMATH DE number 1843733
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial algorithm minimizing submodular functions in strongly polynomial time. |
scientific article; zbMATH DE number 1843733 |
Statements
A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (English)
0 references
10 December 2002
0 references
0.98592573
0 references
0.97303426
0 references
0.9544411
0 references
0.94582963
0 references
0.94582963
0 references
0.92709464
0 references
