136 search results - page 9 / 28 » A Constant-Factor Approximation Algorithm for the k-Median P... |
TALG
2010
13 years 5 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
CPM
2000
Springer
13 years 12 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...