A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.2000.1989 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.2000.1989 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 16 December 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
