A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0004089 / rank | |||
Normal rank | |||
Revision as of 15:48, 19 April 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
