A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:04, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial algorithm minimizing submodular functions in strongly polynomial time. |
scientific article |
Statements
A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (English)
0 references
10 December 2002
0 references
