268 search results - page 23 / 54 » Facility location: distributed approximation |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
CDC
2009
IEEE
14 years 17 days ago
2009
IEEE
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
COCOA
2008
Springer
13 years 9 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...
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...