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 time is linear in the number of metric space points. As the full specification o`f an n-point metric space is of size \Theta(n 2 ), the complexity of our algorithms is sublinear with respect to the input size. All previous algorithms (exact or approximate) for the problems we consider have running time\Omega\Gamma n 2 ). We believe that our techniques can be applied to get similar bounds for other problems. 1 Introduction In recent years there has been a dramatic growth of interest in algorithms operating on massive data sets. This poses new challenges for algorithm design, as algorithms quite efficient on small inputs (for example, having quadratic running time) ...

Citations

533	Approximate nearest neighbors: Towards removing the curse of dimensionality - Indyk, Motwani - 1998
519	Scatter/gather: A cluster-based approach to browsing large document collections - Cutting, Pedersen, et al. - 1992
427	Information retrieval data structures and algorithms - Frakes, Baeza-Yates - 1992
370	Property testing and its connection to learning and approximation - Goldreich, Goldwasser, et al. - 1998
173	Efficient search for approximate nearest neighbor in high dimensional spaces - Kushilevitz, Ostrovsky, et al.
150	Two algorithms for nearest-neighbor search in high dimensions - Kleinberg - 1997
118	Analysis of a local search heuristic for facility location problems - Korupolu, Plaxton, et al.
89	Efficient methods for multiple sequence alignment with guaranteed error bounds - Gusfield - 1993
64	Approximation algorithms for geometric median problems - Lin, Vitter - 1992
51	On recognizing graph properties from adjacency matrices - Rivest, Vuillemin - 1976
44	ffl-approximations with minimum packing constraint violation - Lin, Vitter - 1992
37	A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees - Wu, Lancia, et al. - 1998
33	Long tours and short superstrings - Kosaraju, Park, et al. - 1994
31	On approximate nearest neighbors in non-Euclidean spaces - Indyk - 1998
27	Approximating matrix multiplication for pattern recognition tasks - COHEN, LEWIS - 1999
18	Worst-case analysis of network design problem heuristics - Wong - 1980
17	Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces - Borodin, Ostrovsky, et al. - 1999
8	A constant-factor approximation for the k-median problem - Charikar, Guha, et al. - 1999