An approximation algorithm for submodular hitting set problem with linear penalties
From MaRDI portal
Publication:830939
Recommendations
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Primal-dual approximation algorithms for submodular vertex cover problems with linear/submodular penalties
- Approximation algorithms for the submodular edge cover problem with submodular penalties
- On approximation of the submodular set cover problem
Cites work
- \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- A randomised approximation algorithm for the hitting set problem
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- Approximate Set Covering in Uniform Hypergraphs
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Foundations of Information and Knowledge Systems
- Greedy approximations for minimum submodular cover with submodular cost
- Hitting Set for hypergraphs of low VC-dimension
- scientific article; zbMATH DE number 3720666 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- On approximation of the vertex cover problem in hypergraphs
- Practical and efficient algorithms for the geometric hitting set problem
- Submodular Function Minimization under Covering Constraints
- Submodular functions and optimization.
- The primal-dual method for approximation algorithms
Cited in
(2)
This page was built for publication: An approximation algorithm for submodular hitting set problem with linear penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830939)
