282 search results - page 19 / 57 » Approximation algorithms for facility location problems |
COR
2007
14 years 10 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
COR
2006
14 years 10 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...