84 search results - page 1 / 17 » A Constant Factor Approximation Algorithm for Generalized Mi... |
75
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
135
click to vote
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
145
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...