A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions |
No description defined |
Statements
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (English)
0 references
26 September 2014
0 references
