A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761)
From MaRDI portal
scientific article; zbMATH DE number 5029624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow |
scientific article; zbMATH DE number 5029624 |
Statements
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (English)
0 references
1 June 2006
0 references
combinatorial optimization
0 references
strongly polynomial time algorithm
0 references
submodular function
0 references
network flow
0 references
