56 search results - page 5 / 12 » An optimal bifactor approximation algorithm for the metric u... |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
IPCO
2010
13 years 5 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...