Sciweavers

Share
255 search results - page 1 / 51
» A Constant Factor Approximation Algorithm for Fault-Tolerant...
Sort
View
SODA
2014
ACM
101views Algorithms» more  SODA 2014»
4 years 9 months ago
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li,...
JCSS
2002
199views more  JCSS 2002»
9 years 2 months 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...
FOCS
2010
IEEE
9 years 11 days 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
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
10 years 2 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
TON
2010
101views more  TON 2010»
9 years 22 days ago
Deploying sensor networks with guaranteed fault tolerance
—We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarante...
Jonathan Bredin, Erik D. Demaine, Mohammad Taghi H...
books