A fast algorithm for the alpha-connected two-center decision problem
DOI10.1016/S0020-0190(02)00402-7zbMATH Open1173.68720MaRDI QIDQ1007526FDOQ1007526
Authors: Po-Hsueh Huang, Yin Te Tsai, Chuan Yi Tang 
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
computational geometry\(k\)-center problemalpha-connected two-center decision problemcenter-hulltwo-center decision problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Title not available (Why is that?)
- Maintenance of configurations in the plane
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Finding tailored partitions
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- More planar two-center algorithms
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- On the shape of a set of points in the plane
- Dynamic Three-Dimensional Linear Programming
- A faster algorithm for the two-center decision problem
- A sweepline algorithm to solve the two-center problem
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
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)
