Optimal algorithm for the planar two-center problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- A faster algorithm for the two-center decision problem
- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
- An Expander-Based Approach to Geometric Optimization
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Bichromatic 2-center of pairs of points
- Computing a geodesic two-center of points in a simple polygon
- Efficient \(k\)-center algorithms for planar points in convex position
- Efficient planar two-center algorithms
- Finding tailored partitions
- Improved algorithms for the bichromatic two-center problem for pairs of points
- Kinetic 2-centers in the black-box model
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- More planar two-center algorithms
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On the planar two-center problem and circular hulls
- On the shape of a set of points in the plane
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- Slowing down sorting networks to obtain faster sorting algorithms
- The 2-center problem with obstacles
- The discrete 2-center problem
- The geodesic 2-center problem in a simple polygon
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- Unit-disk range searching and applications
This page was built for publication: Optimal algorithm for the planar two-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895862)
