A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
description / en | description / en | ||
Revision as of 14:57, 2 May 2024
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