A note on submodular function minimization with covering type linear constraints (Q722536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-017-0363-8 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Learning with Submodular Functions: A Convex Optimization Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual schema for capacitated covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial 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 combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph cuts with interacting edge weights: examples, approximations, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under a Submodular Set Covering Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / 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: Submodular Approximation: Sampling-based Algorithms and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-017-0363-8 / rank
 
Normal rank

Latest revision as of 02:02, 10 December 2024

scientific article
Language Label Description Also known as
English
A note on submodular function minimization with covering type linear constraints
scientific article

    Statements

    A note on submodular function minimization with covering type linear constraints (English)
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    submodular function minimization
    0 references
    primal-dual approximation algorithm
    0 references

    Identifiers