Application of computational geometry to network p-center location problems

In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved algorithm for the continuous case with running time O(mp np/2 2log n log n). The previous best result for the problem is O(mp np (n) log n) where (n) is the inverse Ackermann function [16]. When the underlying network is a partial k-tree (k fixed), by exploiting the geometry inherent in the problem we showed that the discrete p-center problem can be solved in O(pnp log k n) time.

• Type: Conference
• Year: 2008
• Where: CCCG
• Authors: Qiaosheng Shi, Binay K. Bhattacharya
• Keywords: 2)-center Location Problem, CCCG 2008, Computational Geometry, Klee's Measure Problem, Log N