Sciweavers

Share
141 search results - page 1 / 29
» A Constant-Factor Approximation Algorithm for the k-Median P...
Sort
View
JCSS
2002
199views more  JCSS 2002»
9 years 28 days ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
SODA
2014
ACM
101views Algorithms» more  SODA 2014»
4 years 8 months ago
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li,...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
10 years 1 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
9 years 5 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
FOCS
2010
IEEE
8 years 11 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
books