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 17 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- The class cover problem with boxes (Q419500) (← 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)
- Covering a bichromatic point set with two disjoint monochromatic disks (Q1931262) (← links)
- Covering and piercing disks with two centers (Q1931270) (← 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)
- On Isolating Points Using Disks (Q3092217) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Bichromatic separability with two boxes: A general approach (Q3497513) (← links)
- Constrained square-center problems (Q5054846) (← links)