@article {15226,
	title = {Facility Location with Dynamic Distance Functions},
	journal = {Journal of Combinatorial Optimization},
	volume = {2},
	year = {1998},
	month = {1998///},
	pages = {199 - 217},
	abstract = {Facility location problems have always been studied with theassumption that the edge lengths in the network are static anddo not change over time. The underlying network could be used to model a city street networkfor emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to trafficcongestion 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) ascenters, 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 forthe K-center problem under this model. This is the first comprehensive study regarding approximation algorithmsfor facility location for good time-invariant solutions.},
	doi = {10.1023/A:1009796525600},
	author = {Khuller, Samir and Sussmann,Y. J and Bhatia,Randeep and Guha,Sudipto}
}
