Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Approximation schemes for Euclidean kmedians and related Sanjeev Arora #
 

Summary: Approximation schemes for Euclidean k­medians and related
problems
Sanjeev Arora #
Princeton University
Prabhakar Raghavan +
IBM Research
Satish Rao #
NEC Research
Abstract
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 from each of the
points of S to the nearest median is minimized.
This paper gives an approximation scheme for
the plane that for any c > 0 produces a solu­
tion of cost at most 1 + 1/c times the optimum
and runs in time O(n O(c+1) ). The approxima­
tion scheme also generalizes to some problems
related to k­median.

  

Source: Arora, Sanjeev - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences