A faster strongly polynomial time algorithm for submodular function minimization (Q1016120): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/mp/Orlin09, #quickstatements; #temporary_batch_1735563769465
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-007-0189-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-007-0189-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050511894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for submodular function minimization and submodular flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Scaling Algorithm for Minimizing Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Schrijver's submodular function minimization algorithm. / rank
 
Normal 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
links / mardi / namelinks / mardi / name
 

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
    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
    0 references
    submodular function minimization
    0 references
    strongly polynomial time algorithm
    0 references

    Identifiers