A note on submodular function minimization with covering type linear constraints
From MaRDI portal
(Redirected from Publication:722536)
Recommendations
- Submodular function minimization under a submodular set covering constraint
- Submodular function minimization with submodular set covering constraints and precedence constraints
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- Maximizing submodular set functions subject to multiple linear constraints
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
Cites work
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
- Discrete Convex Analysis
- Geometric algorithms and combinatorial optimization
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Learning with submodular functions: a convex optimization perspective
- Minimizing symmetric submodular functions
- Primal-dual schema for capacitated covering problems
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Submodular Function Minimization under Covering Constraints
- Submodular function minimization under a submodular set covering constraint
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(9)- Minimizing ratio of monotone non-submodular functions
- A note on submodular function minimization by Chubanov's LP algorithm
- Approximation algorithms for the submodular hitting set problem
- Submodular function minimization with submodular set covering constraints and precedence constraints
- Finding submodularity hidden in symmetric difference
- Submodular function minimization under a submodular set covering constraint
- Approximation algorithms for the submodular edge cover problem with submodular penalties
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
This page was built for publication: A note on submodular function minimization with covering type linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722536)
