The following pages link to More planar two-center algorithms (Q1961384):
Displaying 46 items.
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- A streaming algorithm for 2-center with outliers in high dimensions (Q680151) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- The mixed center location problem (Q1631666) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← 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)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← 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)
- Topological stability of kinetic \(k\)-centers (Q2662690) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← 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)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands (Q6087776) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- An optimal and practical algorithm for the planar 2-center problem (Q6636068) (← links)
