Pages that link to "Item:Q839638"

The following pages link to Covering many or few points with unit disks (Q839638):

Displaying 10 items.

• An improved approximation algorithm for the most points covering problem (Q692901) (← links)
• Enclosing weighted points with an almost-unit ball (Q990963) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
• Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
• The most points connected-covering problem with two disks (Q2322704) (← links)
• A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
• Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
• Covering Polygons with Rectangles (Q2988828) (← links)
• Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)