A comment on a minmax location problem
Introduction
Hamacher and Schöbel [3] investigate the following location problem: The input consists of a set P of n points p1,…,pn in the Euclidean plane that describes the places where the already existing facilities are located. Moreover, there is a so-called forbidden region that is a convex polyhedral region that is bounded by f edges. The goal is to compute a new location that minimizes the functionwhere ‖·‖2 denotes the Euclidean distance. In other words, the goal is to find a circle with the smallest possible radius that encloses all points in P and whose center is not contained in the forbidden region . From now on, this problem will be abbreviated by LOCFORB.
Hamacher and Schöbel [3] derive an O(I3) time algorithm for LOCFORB, where I=n+f denotes the size of the input. For the unrestricted version of this problem (where there is no forbidden region) Megiddo’s celebrated paper [5] contains an O(I) linear time solution algorithm.
In this short note, we first derive an time algorithm for LOCFORB. The algorithm is based on straightforward applications of techniques from computational geometry (cf. Section 2). Moreover, we will show that there cannot exist an algorithm with better time complexity by providing a matching lower bound in Ben-Or’s algebraic computation tree model [1], (cf. Section 3).
Section snippets
A fast algorithm
In our time algorithm for LOCFORB, we will use three simple ingredients from computational geometry:
The first ingredient is the farthest neighbor Voronoi diagram (see e.g. [7] or [2]), a concept that dates back to the early days of computational geometry. For given points p1,…,pn, the farthest neighbor Voronoi diagram is a straight-line subdivision of the Euclidean plane into convex polyhedral cells C1,…,Cn where some of these cells may be empty. For every i, 1⩽i⩽n, and for every point
A lower bound
In this section, we will derive an lower bound on the time complexity of any solution algorithm for LOCFORB in the algebraic computation tree (ACT). The ACT is one of the standard models of computation in Theoretical Computer Science (cf. e.g. 1, 6, 8). The atomic operations that can be performed within one time-unit in the ACT are the arithmetic operations +, −, , /, and branching operations that compare a variable against 0.
In the UNIFORM-GAP-ON-A-CIRCLE problem, one is given n
References (8)
- M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual Symp. on the Theory of Computing, 1983, pp....
- H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin,...
- et al.
A note on center problems with forbidden polyhedra
Oper. Res. Lett.
(1997) - et al.
Geometric complexity and some location problems
Algorithmica
(1986)
Cited by (5)
Complexity results on planar multifacility location problems with forbidden regions
2019, Mathematical Methods of Operations ResearchThe 1-Center and 1-Highway problem revisited
2016, Annals of Operations ResearchA modelling framework for solving restricted planar location problems using phi-objects
2016, Journal of the Operational Research SocietyThe 1-center and 1-highway problem
2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Lower Bounds for Covering Problems
2002, Journal of Mathematical Modelling and Algorithms
- 1
Supported by the START program Y43-MAT of the Austrian Ministry of Science.