Piotr Indyk  Home/Search
Context Related
| mit.edu/~indyk/metrics99.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: mit.edu/~indyk/p (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we give approximation algorithms for the following problems on metric spaces: Furthest Pair, k-median, Minimum Routing Cost Spanning Tree, Multiple Sequence Alignment, Maximum Traveling Salesman Problem, Maximum Spanning Tree and Average Distance. The key property of our algorithms is that their running times is linear in the number of points. As the full specification of an n-point metric space is of size \Theta(n 2 ), the complexity of our algorithms is sublinear with respect... (Update)
Similar documents based on text: More All
0.2: Sublinear Time Algorithms for Metric Space Problems - Indyk (Correct)
0.2: CS37501-1 Randomized Algorithms Winter 2003 - Lecture January Lecturer (Correct)
0.1: Approximate Nearest Neighbors: Towards Removing the Curse of.. - Indyk, Motwani (1998) (Correct)
BibTeX entry: (Update)
P. Indyk, "Sublinear time algorithms for metric space problems", STOC'99. http://citeseer.ist.psu.edu/indyk00sublinear.html More
@inproceedings{ indyk99sublinear,
author = "Piotr Indyk",
title = "Sublinear time algorithms for metric space problems",
pages = "428--434",
year = "1999",
url = "citeseer.ist.psu.edu/indyk00sublinear.html" }
Citations (may not include all citations):301 Improved Combinatorial Algorithms for the Facility Location .. - Charikar, Guha
243 Information Retrieval - Data Structures and Algorithms (context) - Frakes, Baeza-Yates - 1992
217 Analysis of a Local Search Heuristic for Facility Location P.. - Korupolu, Plaxton et al.
167 Property testing and its connection to Learning and Approxim.. - Goldreich, Goldwasser et al.
165 Approximate Nearest Neighbors: Towards Removing the Curse of.. - Indyk, Motwani
91 Two Algorithms for Nearest Neighbor Search in High Dimension.. - Kleinberg
86 Primal-Dual Approximation Algorithms for Metric Facility Loc.. - Jain, Vazirani
46 Efficient search for approximate nearest neighbor in high di.. - Kushilevitz, Ostrovsky et al.
44 Approximation Algorithms for Geometric Median Problems - Lin, Vitter - 1992
42 Efficient methods for multiple sequence alignments with guar.. (context) - Gusfield - 1993
39 ffl-Approximations with Minimum Packing Constraint Violation (context) - Lin, Vitter
33 Spot-Checkers - Ergun, Kannan et al.
32 On recognizing graph properties from adjacency matrices (context) - Rivest, Vuillemin - 1976
29 Long Tours and Short Superstrings (context) - Kosaraju, Park et al.
24 A Polynomial Time Approximation Scheme for Minimum Routing C.. - Wu, Lancia et al.
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.toc.lcs.mit.edu/~indyk/p.html): More
Dimensionality Reduction Techniques for Proximity Problems - Indyk (2000) (Correct)
Finding Interesting Associations without Support Pruning - Cohen, Datar, Fujiwara.. (1999) (Correct)
A Sublinear Time Approximation Scheme for Clustering in Metric.. - Indyk (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC