Minimization problems with non-submodular cover constraint
From MaRDI portal
Publication:6542984
DOI10.1142/S0217595923400122zbMATH Open1547.90173MaRDI QIDQ6542984FDOQ6542984
Authors: Wen-qi Wang, Zhicheng Liu, Donglei Du, Peihao Shi, Xiaoyan Zhang 
Publication date: 23 May 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Minimum non-submodular cover problem with applications
- Submodular function minimization under a submodular set covering constraint
- Submodular function minimization with submodular set covering constraints and precedence constraints
- On minimum submodular cover with submodular cost
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
combinatorial optimizationapproximation algorithmgreedy algorithmprimal-dual algorithmsubmodular function
Cites Work
- Reducibility among combinatorial problems
- Approximation algorithms for combinatorial problems
- A Greedy Heuristic for the Set-Covering Problem
- The ellipsoid method and its consequences in combinatorial optimization
- On the ratio of optimal integral and fractional covers
- Geometric algorithms and combinatorial optimization.
- An analysis of the greedy algorithm for the submodular set covering problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Submodular Function Minimization under Covering Constraints
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Analytical approach to parallel repetition
- Discrete convex analysis
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
- Minimum non-submodular cover problem with applications
- Submodular function minimization under a submodular set covering constraint
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Submodular function minimization with submodular set covering constraints and precedence constraints
- Primal-dual algorithms for precedence constrained covering problems
Cited In (1)
This page was built for publication: Minimization problems with non-submodular cover constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542984)
