Sciweavers

268 search results - page 14 / 54
» Facility location: distributed approximation
Sort
View
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...
COCOON
2004
Springer
15 years 3 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
80
Voted
EOR
2006
76views more  EOR 2006»
14 years 11 months ago
Load balancing and capacity constraints in a hierarchical location model
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...
Roberto D. Galvão, Luis Gonzalo Acosta Espe...
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 6 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
MDM
2004
Springer
15 years 5 months ago
Middleware Providing Dynamic Group Communication Facility for Cellular Phone Applications
In this paper, we propose a middleware library for efficiently developing distributed cooperative applications consisting of a large number of cellular phones with Java executors....
Kouji Nishigaki, Keiichi Yasumoto, Takaaki Umedu, ...