A fast algorithm for the alpha-connected two-center decision problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- A faster algorithm for the two-center decision problem
- A sweepline algorithm to solve the two-center problem
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Dynamic Three-Dimensional Linear Programming
- Finding tailored partitions
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Maintenance of configurations in the plane
- More planar two-center algorithms
- On the shape of a set of points in the plane
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Randomized incremental construction of Delaunay and Voronoi diagrams
- The slab dividing approach to solve the Euclidean \(P\)-center problem
Cited in
(6)- The most points connected-covering problem with two disks
- A faster algorithm for the two-center decision problem
- An efficient algorithm for the proximity connected two center problem
- The 1-center and 1-highway problem
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
- The discrete and mixed minimax 2-center problems
This page was built for publication: A fast algorithm for the alpha-connected two-center decision problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007526)