On the Minimum Hitting Set of Bundles Problem
From MaRDI portal
Publication:3511409
Recommendations
Cites work
- A new multilayered {PCP} and the hardness of hypergraph vertex cover
- Approximating MIN 2-SAT and MIN 3-SAT
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Dynamic programming solution for multiple query optimization problem
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- On approximation algorithms for the minimum satisfiability problem
- On dependent randomized rounding algorithms
- Structure preserving reductions among convex optimization problems
- The Minimum Satisfiability Problem
- The importance of being biased
Cited in
(5)
This page was built for publication: On the Minimum Hitting Set of Bundles Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511409)