The following pages link to (Q3579437):
Displaying 17 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Unique Coverage with Rectangular Regions (Q4631010) (← links)
- (Q5009574) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- Maximum independent and disjoint coverage (Q5918798) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
