Pages that link to "Item:Q423912"
From MaRDI portal
The following pages link to Approximation algorithms for a geometric set cover problem (Q423912):
Displaying 20 items.
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Approximability issues of guarding a set of segments (Q2855782) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- (Q4843442) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- (Q5290249) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- Approximability of covering cells with line segments (Q5919568) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
