Facility location and the geometric minimum-diameter spanning tree

  • Authors:

  • Joachim Gudmundsson;Herman Haverkort;Sang-Min Park;Chan-Su Shin;Alexander Wolff

  • Affiliations:

  • Dept. of Computer Science, Eindhoven University, Eindhoven, The Netherlands;Dept. of Computer Science, Utrecht University, Utrecht, The Netherlands;Dept. of Computer Science, KAIST, South Korea;School of Electr. and Inform Engineering, Hankuk University of Foreign Studies, South Korea;Institute for Logic, Complexity and Deduction Systems, Karlsruhe University, Karlsruhe, Germany

  • Venue:
  • Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidean length of the longest path. It is known that there is always a mono- or a dipolar MDST, i.e., a MDST with one or two nodes of degree greater 1, respectively. The more difficult dipolar case can so far only be solved in slightly subcubic time.This paper has two aims. First, we present a solution to a new data structure for facility location, the minimum-sum dipolar spanning tree (MSST), that mediates between the minimum-diameter dipolar spanning tree and the discrete two-center problem (2CP) in the following sense: find two centers p and q in P that minimize the sum of their distance plus the distance of any other point (client) to the closer center. This is of interest if the two centers do not only serve their customers (as in the case of the 2CP), but frequently have to exchange goods or personnel between themselves. We show that this problem can be solved in O(n2 log n) time and that it yields a factor-4/3 approximation of the MDST.Second, we give two fast approximation schemes for the MDST, i.e., factor-(1 + ε) approximation algorithms. One uses a grid and takes O*(E6-1/3 + n) time, where E = 1/ε and the O*-notation hides terms of type O(logO(1) E). The other uses the well-separated pair decomposition and takes O(nE3 + En logn) time. A combination of the two approaches runs in O*(E5 + n) time. Both schemes can also be applied to MSST and 2CP.