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: Wikidata QID (P12): Q59592328, #quickstatements; #temporary_batch_1724739681498 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59592328 / rank | |||
Normal rank | |||
Revision as of 07:22, 27 August 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
