The following pages link to (Q5501789):
Displaying 36 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited (Q512987) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- Point set stratification and Delaunay depth (Q1019881) (← links)
- The mixed center location problem (Q1631666) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- The 1-Center and 1-Highway Problem (Q4899274) (← links)
- Constrained square-center problems (Q5054846) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- The two-center problem of uncertain points on trees (Q6606211) (← links)
- An optimal and practical algorithm for the planar 2-center problem (Q6636068) (← links)
