A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:55, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions |
scientific article |
Statements
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (English)
0 references
26 September 2014
0 references
