306 search results - page 12 / 62 » Parallel approximation algorithms for facility-location prob... |
SODA
2008
ACM
14 years 11 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...
81
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
STOC
2004
ACM
15 years 9 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 9 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...