Sciweavers

374 search results - page 5 / 75
» Lower-bounded facility location
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 9 months ago
Differentially Private Combinatorial Optimization
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...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 9 months ago
Differentially Private Approximation Algorithms
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...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
FCT
2005
Springer
15 years 5 months ago
The Complexity of Querying External Memory and Streaming Data
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
Martin Grohe, Christoph Koch, Nicole Schweikardt
83
Voted
STACS
2010
Springer
15 years 6 months ago
Robust Fault Tolerant Uncapacitated Facility Location
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
Shiri Chechik, David Peleg
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 1 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...