A faster strongly polynomial time algorithm for submodular function minimization (Q1016120): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/mp/Orlin09, #quickstatements; #temporary_batch_1735563769465 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-007-0189-2 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59592328 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-007-0189-2 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mp/Orlin09 / rank | |||
Normal rank | |||
Latest revision as of 14:09, 30 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster strongly polynomial time algorithm for submodular function minimization |
scientific article |
Statements
A faster strongly polynomial time algorithm for submodular function minimization (English)
0 references
4 May 2009
0 references
For the problem of minimizing a submodular function \(f(x)\) on a finite set \(V\) a strongly polynomial oracle algorithm is suggested. The algorithm uses distance functions and exploits optimality conditions.
0 references
submodular function minimization
0 references
strongly polynomial time algorithm
0 references
0 references
