Constrained hitting set problem with intervals
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A kernelization algorithm for \(d\)-hitting set
- A modified greedy heuristic for the set covering problem with improved worst case bound
- A threshold of ln n for approximating set cover
- Almost optimal set covers in finite VC-dimension
- Combinatorial optimization. Networks and matroids
- Conflict free version of covering problems on graphs: classical and parameterized
- Graph problems with obligations
- Improved approximation algorithms for geometric set cover
- Kernelization lower bounds through colors and IDs
- On paths avoding forbidden pairs of vertices in a graph
- On problems as hard as CNF-SAT
- Optimal packing and covering in the plane are NP-complete
- Optimal-size problem kernels for d-Hitting Set in linear time and space
- Parameterized algorithms
- Parameterized complexity of conflict-free matchings and paths
- Parameterized complexity of conflict-free set cover
- Parametrized complexity theory.
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Small-size -nets for axis-parallel rectangles and boxes
- Structure preserving reductions among convex optimization problems
- The complexity of satisfiability problems
- Total domination, connected vertex cover and Steiner tree with conflicts
- Towards optimal and expressive kernelization for \(d\)-hitting set
Cited in
(2)
This page was built for publication: Constrained hitting set problem with intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695330)
