Pages that link to "Item:Q2477196"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196):
Displaying 6 items.
- Piercing translates and homothets of a convex body (Q634671) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- Piercing all translates of a set of axis-parallel rectangles (Q2115866) (← links)
- Polynomial time approximation schemes for base station coverage with minimum total radii (Q2484959) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)