A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62111283, #quickstatements; #temporary_batch_1707303357582 |
Removed claim: author (P16): Item:Q178718 |
||
| Property / author | |||
| Property / author: Q787161 / rank | |||
Revision as of 08:38, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial algorithm minimizing submodular functions in strongly polynomial time. |
scientific article |
Statements
A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (English)
0 references
10 December 2002
0 references
