A note on minimizing submodular functions (Q293366): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancestor tree for arbitrary multi-terminal cut functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse subgraphs preserving connectivity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical decompositions of symmetric submodular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Optimally Increasing the Edge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975172458 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:28, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on minimizing submodular functions
scientific article

    Statements

    A note on minimizing submodular functions (English)
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    0 references