@inproceedings{37210a3cd8234b08bf3bb6bc96143a95,

title = "Facility location with dynamic functions distance",

abstract = "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 underlying network 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 traffic 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 Kcenter problem under this model. This is the first comprehensive study regarding approximation algorithms for facility location for good timeinvariant solutions.",

author = "Randeep Bhatia and Sudipto Guha and Samir Khuller and Sussmann, {Yoram J.}",

note = "Publisher Copyright: {\textcopyright} 1998, Springer-Verlag. All rights reserved.; 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998 ; Conference date: 08-07-1998 Through 10-07-1998",

year = "1998",

doi = "10.1007/BFb0054352",

language = "English (US)",

isbn = "3540646825",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "23--34",

editor = "Stefan Arnborg and Lars Ivansson",

booktitle = "Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings",

}