Pages that link to "Item:Q528480"
From MaRDI portal
The following pages link to The within-strip discrete unit disk cover problem (Q528480):
Displaying 10 items.
- \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
- Covering and packing of triangles intersecting a straight line (Q5918763) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Line segment disk cover (Q5919111) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)
