268 search results - page 12 / 54 » Facility location: distributed approximation |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
HEURISTICS
1998
13 years 7 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
MOR
2010
13 years 6 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...