MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A Constant-Factor Approximation Algorithm for the k-Median Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

ATOM

A constant-factor approximation algorithm for the k-median problem
by Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys — 1999 — In Proceedings of the 31st Annual ACM Symposium on Theory of Computing
…A constant-factor approximation algorithm for the k-median problem Moses Charikar ∗ Sudipto Guha…
Cited by 136 (11 self) – Add To MetaCart

Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
by Fabi'an A. Chudak, Tim Roughgarden, David P. Williamson — 2001 — Mathematical Programming
…], invented for a constant-factor approximation algorithm for the k-median problem, also give constant-factor…
Cited by 19 (4 self) – Add To MetaCart

Showing 1 through 2.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB