A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Merged Item from Q5441358 |
||||||||||||||
(One intermediate revision by the same user not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
A combinatorial strongly polynomial algorithm for minimizing submodular functions | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | scientific article; zbMATH DE number 5234644 | ||||||||||||||
Property / title | |||||||||||||||
A combinatorial strongly polynomial algorithm for minimizing submodular functions (English) | |||||||||||||||
Property / title: A combinatorial strongly polynomial algorithm for minimizing submodular functions (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1127.90402 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1145/502090.502096 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Journal of the ACM / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
11 February 2008
| |||||||||||||||
Property / publication date: 11 February 2008 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68W40 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90C60 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 5234644 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2128059732 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Wikidata QID | |||||||||||||||
Property / Wikidata QID: Q62111282 / rank | |||||||||||||||
Normal rank |
Latest revision as of 10:13, 6 May 2024
scientific article; zbMATH DE number 5234644
- A combinatorial strongly polynomial algorithm for minimizing submodular functions
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions |
scientific article; zbMATH DE number 5234644 |
|
Statements
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (English)
0 references
A combinatorial strongly polynomial algorithm for minimizing submodular functions (English)
0 references
26 September 2014
0 references
11 February 2008
0 references