Pages that link to "Item:Q603882"
From MaRDI portal
The following pages link to Improved results on geometric hitting set problems (Q603882):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Location, pricing and the problem of Apollonius (Q1686568) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- Existence of planar support for geometric hypergraphs using elementary techniques (Q2174599) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Discretely Following a Curve (Q2867104) (← links)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Discrete unit square cover problem (Q4644781) (← links)