A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271)
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 5216145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization |
scientific article; zbMATH DE number 5216145 |
Statements
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (English)
0 references
29 November 2007
0 references
0 references
0.94582963
0 references
0.94083536
0 references
0.92812616
0 references
0.9262221
0 references
0.9126524
0 references
