Sciweavers

Share
214 search results - page 1 / 43
» Constant factor approximation algorithm for the knapsack med...
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
7 years 5 months ago
Constant factor approximation algorithm for the knapsack median problem
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...
Amit Kumar
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
2004
IEEE
9 years 6 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
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,...
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
books