A near-linear algorithm for the planar 2-center problem
From MaRDI portal
Recommendations
- A near-linear algorithm for the planar segment-center problem
- scientific article; zbMATH DE number 1003238
- Efficient planar two-center algorithms
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- More planar two-center algorithms
- An Algorithm for the p-Center Problem in the Plane
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
- scientific article; zbMATH DE number 1696646
- Approximation algorithms for a \(k\)-line center
Cited in
(50)- The discrete 2-center problem
- Pose estimation and object identification using complex algebraic representations
- A sweepline algorithm to solve the two-center problem
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
- The mixed center location problem
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- The 2-center problem in three dimensions
- More planar two-center algorithms
- On the planar two-center problem and circular hulls
- An efficient algorithm for the proximity connected two center problem
- Efficient planar two-center algorithms
- Parametric search: three new applications
- Minimum perimeter-sum partitions in the plane
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments
- The discrete and mixed minimax 2-center problems
- A simple linear algorithm for computing rectilinear 3-centers
- The two-center problem of uncertain points on a real line
- Obnoxious facility location: complete service with minimal harm
- scientific article; zbMATH DE number 1588326 (Why is no real title available?)
- Efficiently approximating color-spanning balls
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- The Mixed Center Location Problem
- Computing a Segment Center for a Planar Point Set
- scientific article; zbMATH DE number 5667431 (Why is no real title available?)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- The discrete and mixed minimax 2-center problem
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Base station placement on boundary of a convex polygon
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Covering convex polygons by two congruent disks
- Intersecting disks using two congruent disks
- Intersecting disks using two congruent disks
- Covering convex polygons by two congruent disks
- A local search approximation algorithm for \(k\)-means clustering
- On solving the planar k-centrum problem with Euclidean distances
- Efficient \(k\)-center algorithms for planar points in convex position
- An optimal and practical algorithm for the planar 2-center problem
- Convex polygon containment: improving quadratic to near linear time
- Clustering with few disks to minimize the sum of radii
- An optimal and practical algorithm for the planar 2-center problem
- Optimal algorithm for the planar two-center problem
- Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
- A space-partition based approach to the 2-center problem in three and higher dimensions
- Improved algorithms for the bichromatic two-center problem for pairs of points
This page was built for publication: A near-linear algorithm for the planar 2-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364134)
