Estimating the weight of metric minimum spanning trees in sublinear time

SIAM Journal on Computing

Volumn 39, Issue 3, 2009, Pages 904-922

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Randomized algorithms; Sublinear time algorithms

Indexed keywords

DETERMINISTIC ALGORITHMS; METRIC SPACES; MINIMUM SPANNING TREES; RANDOMIZED ALGORITHMS; RUNNING TIME; SPANNING TREE; SUBLINEAR TIME; SUBLINEAR-TIME ALGORITHMS;

SET THEORY; TOPOLOGY;

APPROXIMATION ALGORITHMS;

EID: 78249238019     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060672121     Document Type: Article

References (24)

1. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
2. T. BATU, F. ERGÜN, J. KILIAN, A. MAGEN, S. RASKHODNIKOVA, R. RUBINFELD, AND R. SAMI, A sublinear algorithm for weakly approximating edit distance, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 316-324.
3. P. BERENBRINK, F. ERGÜN, AND T. FRIEDETZKY, Finding frequent patterns in a string in sublinear time, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA), Springer-Verlag, Berlin, 2005, pp. 746-757.
4. P. B. CALLAHAN AND S. R. KOSARAJU, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. ACM, 42 (1995), pp. 67-90.
5. B. CHAZELLE, A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, 47 (2000), pp. 1012-1027.
6. B. CHAZELLE, D. LIU, AND A. MAGEN, Sublinear geometric algorithms, SIAM J. Comput., 35 (2006), pp. 627-646.
7. B. CHAZELLE, R. RUBINFELD, AND L. TREVISAN, Approximating the minimum spanning tree weight in sublinear time, SIAM J. Comput., 34 (2005), pp. 1370-1379.
8. A. CZUMAJ, F. ERGÜN, L. FORTNOW, A. MAGEN, I. NEWMAN, R. RUBINFELD, AND C. SOHLER, Approximating the weight of the Euclidean minimum spanning tree in sublinear time, SIAM J. Comput., 35 (2005), pp. 91-109.
9. A. CZUMAJ AND C. SOHLER, Sublinear-time algorithms, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 89 (2006), pp. 23-47.
10. D. EPPSTEIN, Spanning trees and spanners, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., North-Holland, Amsterdam, 2000, pp. 425-461.
11. F. ERGÜN, S. MUTHUKRISHNAN, AND C. SAHINALP, Sublinear methods for detecting periodic trends in data streams, in Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN), Springer-Verlag, Berlin, 2004, pp. 16-28.
12. A. FRIEZE AND R. KANNAN, The regularity lemma and approximation schemes for dense problems, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), 1996, pp. 12-20.
13. A. FRIEZE, R. KANNAN, AND S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, J. ACM, 51 (2004), pp. 1025-1041.
14. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
15. O. GOLDREICH AND D. RON, Approximating average parameters of graphs, in Proceedings of the 10th International Workshop on Randomization and Computation (RANDOM), Springer-Verlag, Berlin, Heidelberg, 2006, pp. 363-374.
16. A. HAJNAL AND E. SZEMERÉDI, Proof of a conjecture of P. Erdo{combining double acute accent}s, in Combinatorial Theory and Its Applications, Vol. 2, P. Erdo{combining double acute accent}s, A. Rényi, and V. T. Sós, eds., North-Holland, London, 1970, pp. 601-623.
17. P. INDYK, A sublinear time approximation scheme for clustering in metric spaces, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 154-159.
18. P. INDYK, Sublinear time algorithms for metric space problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pp. 428-434.
19. D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear-time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
20. N. MISHRA, D. OBLINGER, AND L. PITT, Sublinear time approximate clustering, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 439-447.
21. M. PARNAS AND D. RON, Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms, Theoret. Comput. Sci., 381 (2007), pp. 183-196.
22. S. PETTIE AND V. RAMACHANDRAN, An optimal minimum spanning tree algorithm, J. ACM, 49 (2002), pp. 16-34.
23. V. V. VAZIRANI, Approximation Algorithms, Springer-Verlag, Berlin, 2001.
24. A. C.-C. YAO, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput., 11 (1982), pp. 721-736.