A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976)
From MaRDI portal
scientific article; zbMATH DE number 5234644
- A combinatorial strongly polynomial algorithm for minimizing submodular functions
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions |
scientific article; zbMATH DE number 5234644 |
|
Statements
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (English)
0 references
A combinatorial strongly polynomial algorithm for minimizing submodular functions (English)
0 references
26 September 2014
0 references
11 February 2008
0 references
