On Geometric Set Cover for Orthants
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 6850339 (Why is no real title available?)
- scientific article; zbMATH DE number 7236474 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A birthday repetition theorem and complexity of approximating dense CSPs
- A note on the \(\epsilon\)-indicator subset selection
- A tight lower bound for planar multiway cut with fixed number of terminals
- Almost optimal set covers in finite VC-dimension
- Analytical approach to parallel repetition
- Approximately dominating representatives
- Approximating multiobjective knapsack problems
- Approximation Schemes for Covering and Packing
- Approximation algorithms for combinatorial problems
- Efficiently computing succinct trade-off curves
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- Finding small simple cycle separators for 2-connected planar graphs
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- Geometric Set Cover and Hitting Sets for Polytopes in R
- Improved approximation algorithms for geometric set cover
- Improved results on geometric hitting set problems
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
- On the possibility of faster \textsc{SAT} algorithms
- On the ratio of optimal integral and fractional covers
- Optimal packing and covering in the plane are NP-complete
- Optimization, approximation, and complexity classes
- Orthogonal range searching on the RAM, revisited
- PTAS for weighted set cover on unit squares
- Packing and covering with non-piercing regions
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Parameterized algorithms
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Random knapsack in expected polynomial time
- Small-size -nets for axis-parallel rectangles and boxes
- The NP-completeness column: An ongoing guide
- The complexity of dominating set in geometric intersection graphs
- The limited blessing of low dimensionality: when \(1-1/d\) is the best possible exponent for \(d\)-dimensional geometric problems (extended abstract)
- Tight lower bounds for the size of epsilon-nets
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Weighted geometric set cover via quasi-uniform sampling
- Which problems have strongly exponential complexity?
Cited in
(6)- Overlarge sets and partial geometries
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
- Surprising Applications of Treewidth Bounds for Planar Graphs
- On the geometric priority set cover problem
- Geometric Set Cover and Hitting Sets for Polytopes in R
- Geometric red-blue set cover for unit squares and related problems
This page was built for publication: On Geometric Set Cover for Orthants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075763)
