Pages that link to "Item:Q929745"
From MaRDI portal
The following pages link to Covering point sets with two disjoint disks or squares (Q929745):
Displaying 11 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Spherical coverage verification (Q440948) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
