Constrained hitting set problem with intervals
From MaRDI portal
Publication:2695330
DOI10.1007/978-3-030-89543-3_50OpenAlexW3211061913MaRDI QIDQ2695330
Vahideh Keikha, Diptapriyo Majumdar, Ankush Acharyya, Supantha Pandit
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_50
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards optimal and expressive kernelization for \(d\)-hitting set
- On paths avoding forbidden pairs of vertices in a graph
- Improved approximation algorithms for geometric set cover
- A kernelization algorithm for \(d\)-hitting set
- Structure preserving reductions among convex optimization problems
- Optimal packing and covering in the plane are NP-complete
- A modified greedy heuristic for the set covering problem with improved worst case bound
- Almost optimal set covers in finite VC-dimension
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Parameterized complexity of conflict-free matchings and paths
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
- Graph problems with obligations
- Parametrized complexity theory.
- A threshold of ln n for approximating set cover
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Kernelization Lower Bounds Through Colors and IDs
- On Problems as Hard as CNF-SAT
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- The complexity of satisfiability problems
- Parameterized Algorithms
- Parameterized complexity of conflict-free set cover
- Conflict free version of covering problems on graphs: classical and parameterized
This page was built for publication: Constrained hitting set problem with intervals
