The slab dividing approach to solve the Euclidean \(P\)-center problem
From MaRDI portal
Publication:1207325
DOI10.1007/BF01185335zbMath0766.68136OpenAlexW2125585783WikidataQ57568244 ScholiaQ57568244MaRDI QIDQ1207325
R. Z. Hwang, Richard Chia-Tung Lee, Ruei-Chuan Chang
Publication date: 1 April 1993
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185335
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
The geodesic 2-center problem in a simple polygon, The mixed center location problem, Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, Topological stability of kinetic \(k\)-centers, The Mixed Center Location Problem, The discrete and mixed minimax 2-center problems, Covering moving points with anchored disks, Efficient \(k\)-center algorithms for planar points in convex position, The connected disk covering problem, \(k\)-balanced center location problem: a new multi-objective facility location problem, THE ALIGNED K-CENTER PROBLEM, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs, On the minimum consistent subset problem, Covering convex polygons by two congruent disks, Intersecting disks using two congruent disks, A fast algorithm for the alpha-connected two-center decision problem, Intersecting disks using two congruent disks, Generalized \(p\)-center problems: Complexity results and approximation algorithms, Covering a set of line segments with a few squares, Covering a set of line segments with a few squares, An elliptical cover problem in drone delivery network design and its solution algorithms, On interval and circular-arc covering problems, Computing a geodesic two-center of points in a simple polygon, Fast stabbing of boxes in high dimensions, Covering convex polygons by two congruent disks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- On the Complexity of Some Common Geometric Location Problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Note—On a Modified One-Center Model
- On the rectangularp-center problem
