Pages that link to "Item:Q866970"
From MaRDI portal
The following pages link to Improved approximation algorithms for geometric set cover (Q866970):
Displaying 30 items.
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- Guarding 1.5D terrains with demands (Q4902836) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- (Q5115778) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS (Q5261016) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- (Q5743501) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Helly-type theorems for approximate covering (Q5896959) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Approximability of covering cells with line segments (Q5919568) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
- One-sided terrain guarding and chordal graphs (Q6204302) (← links)
- Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
- Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
