A Sublinear Time Approximation Scheme for Clustering in Metric Spaces

13 years 9 months ago

Download reference.kfupm.edu.sa

The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this paper we show an approximation scheme for this problem.

Piotr Indyk

Real-time Traffic

Approximation Scheme | FOCS 1999 | Metric 2-clustering Problem | Theoretical Computer Science |

claim paper

» A SublinearTime Randomized Approximation Scheme for the RobinsonFoulds Metric

» Small Space Representations for Metric MinSum k Clustering and Their Applications

» Facility Location in Sublinear Time

» XML Filtering Using Dynamic Hierarchical Clustering of User Profiles

» Sublinear Time Algorithms for Earth Movers Distance

» Estimating the weight of metric minimum spanning trees in sublineartime

» Approximation schemes for Metric Bisection and partitioning

» Efficient Image Matching with Distributions of Local Invariant Features

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Piotr Indyk

Comments (0)

Sciweavers

A Sublinear Time Approximation Scheme for Clustering in Metric Spaces

Approximation Scheme | FOCS 1999 | Metric 2-clustering Problem | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers