209

Improved Combinatorial Algorithms for the Facility Location and kMedian Problems
– Moses Charikar, Sudipto Guha
 1999

324

Primaldual approximation algorithms for metric facility location and kmedian problems
– Vijay V. Vazirani
 1999

215

A constantfactor approximation algorithm for the kmedian problem
– Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
 1999

47

Sublinear Time Approximate Clustering
– Nina Mishra, Dan Oblinger, Leonard Pitt
 2001

234

Local search heuristics for kmedian and facility location problems
– Vijay Arya, Naveen Garg, Rohit Khandekarý, Adam Meyersonþ, Kamesh Munagalaü
 2001

60

Testing of Clustering
– Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
 2000

253

Clustering Data Streams
– Sudipto Guha, et al.
 2000

153

Incremental Clustering and Dynamic Information Retrieval
– Moses Charikar, Chandra Chekuri
 1997

41

A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
– Piotr Indyk

121

Approximation schemes for Euclidean kMedians And Related Problems
– Sanjeev Arora, Prabhakar Raghavan, Satish Rao
 1998

148

Analysis of a local search heuristic for facility location problems
– Madhukar R. Korupolu, C. Greg Plaxton , Rajmohan Rajaraman
 1998

70

Approximation Algorithms for Geometric Median Problems
– JyhHan Lin, Jeffrey Scott Vitter
 1992

278

Clustering to minimize the maximum intercluster distance
– T F Gonzalez
 1985

99

Random sampling techniques for space efficient online computation of order statistics of large datasets
– Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G. Lindsay
 1999

263

Approximation algorithms for facility location problems
– David B. Shmoys, Eva Tardos, Karen Aardal
 1997

116

A new greedy approach for facility location problems
– Kamal Jain, Mohammad Mahdian, Amin Saberi

168

Optimal algorithms for approximate clustering
– T Feder, D Greene
 1988

17

Quick kmedian, kcenter, and facility location for sparse graphs
– M Thorup
 2001

75

The Online Median Problem
– Ramgopal R. Mettu, C. Greg Plaxton
 2000
