Facility Location with Dynamic Distance Functions

Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be used to model a city street network for emergency facility location hospitals, or an electronic network for locating information centers. In any case, it is clear that due to tra c congestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations vertices as centers, such that at every time instant each vertex has a center close to it clearly, the center close to a vertex may change over time. We also provide approximation algorithms as well as hardness results for the K-center problemunder this model. This is the rst comprehensivestudyregarding approximation algorithms for facility location for good time-invariant solutions.

• Type: Journal
• Year: 1998
• Where: JCO
• Authors: Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
• Keywords: Facility Location, Facility Location Hospitals, Facility Location Problems, JCO 1998