On the minimum hitting set of bundles problem
DOI10.1016/J.TCS.2009.08.017zbMATH Open1175.68557OpenAlexW2786382671MaRDI QIDQ1035686FDOQ1035686
Authors: Eric Angel, Evripidis Bampis, Laurent Gourvès 
Publication date: 4 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/2149
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Structure preserving reductions among convex optimization problems
- On approximation algorithms for the minimum satisfiability problem
- The Minimum Satisfiability Problem
- On dependent randomized rounding algorithms
- The importance of being biased
- A new multilayered {PCP} and the hardness of hypergraph vertex cover
- Approximating MIN 2-SAT and MIN 3-SAT
- Dynamic programming solution for multiple query optimization problem
Cited In (7)
- Title not available (Why is that?)
- Towards formal XAI: formally approximate minimal explanations of neural networks
- On the Minimum Hitting Set of Bundles Problem
- Minimal approximate hitting sets and rule templates
- Minimum hitting set of interval bundles problem: computational complexity and approximability
- Parameterizations of hitting set of bundles and inverse scope
- On the minimum consistent subset problem
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 Q1035686)
