Constrained hitting set problem with intervals (Q2695330): Difference between revisions

@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of conflict-free matchings and paths
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for geometric set cover
+Normal rank
@@ Property / cites work @@
+Q4560218
@@ Property / cites work: Q4560218 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph problems with obligations
@@ Property / cites work: Graph problems with obligations / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A modified greedy heuristic for the set covering problem with improved worst case bound
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of conflict-free set cover
+Normal rank
@@ Property / cites work @@
+Conflict free version of covering problems on graphs: classical and parameterized
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Towards optimal and expressive kernelization for \(d\)-hitting set
+Normal rank
@@ Property / cites work @@
+Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
+Normal rank
@@ Property / cites work @@
+Representative families for matroid intersections, with applications to location, packing, and covering problems
+Normal rank
@@ Property / cites work @@
+On paths avoding forbidden pairs of vertices in a graph
+Normal rank