Abstract
In the online version of Facility Location, the demand points arrive one at a time and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We present a simple primal-dual deterministic algorithm for the general case of non-uniform facility costs. We prove that its competitive ratio is no greater than 4 log(n +1) + 2, which is close to the lower bound of Ω(log n/log log n). © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Fotakis, D. (2005). A primal-dual algorithm for online non-uniform facility location. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3746 LNCS, pp. 47–56). https://doi.org/10.1007/11573036_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
