A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271)
From MaRDI portal
scientific article; zbMATH DE number 5216145
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
