The following pages link to On a circle placement problem (Q1062430):
Displaying 38 items.
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Uniform fourth order difference scheme for a singular perturbation problem (Q1118364) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Computing large planar regions in terrains, with an application to fracture surfaces (Q1827827) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Minimizing Sum of Truncated Convex Functions and Its Applications (Q3391176) (← links)
- A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING (Q3575389) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- Computing Large Planar Regions in Terrains (Q4917094) (← links)
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)
- (Q5696224) (← links)
- Location Problems with Cutoff (Q6053539) (← links)
- A novel approximation algorithm for max-covering circle problem (Q6606184) (← links)
- Approximation algorithms for finding maximum containing circle and sphere (Q6652433) (← links)
