zbMATH — the first resource for mathematics

Approximation algorithms for bounded facility location problems. (English) Zbl 1001.90045
Summary: The bounded \(k\)-median problem is to select in an undirected graph \(G=(V,E)\) a set \(S\) of \(k\) vertices such that the distance from any vertex \(v\in V\) to \(S\) is at most a given bound \(d\) and the average distance from vertices \(V\setminus S\) to \(S\) is minimized. We present randomized algorithms for several versions of this problem and we prove some inapproximability results. We also study the bounded version of the uncapacitated facility location problem and present extensions of known deterministic algorithms for the unbounded version.

90B85 Continuous location
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI