Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

70

Voted

STOC
1999
ACM

favoriteEmaildiscussreport

101views Algorithms» more STOC 1999»

Sublinear Time Algorithms for Metric Space Problems

15 years 1 months ago

Sublinear Time Algorithms for Metric Space Problems

Download www.wisdom.weizmann.ac.il

Piotr Indyk

Real-time Traffic

Algorithms | STOC 1999 |

claim paper

Related Content

» Facility Location in Sublinear Time

» SublinearTime Approximation for Clustering Via Random Sampling

» Sublinear Time Algorithms for Earth Movers Distance

» A Sublinear Time Approximation Scheme for Clustering in Metric Spaces

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

» Estimating the weight of metric minimum spanning trees in sublineartime

» Sublinear Optimization for Machine Learning

» A SublinearTime Randomized Approximation Scheme for the RobinsonFoulds Metric

» Bit Allocation in Sublinear Time and the MultipleChoice Knapsack Problem

Post Info
More Details (n/a)

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

Comments (0)