Randomized minimum spanning tree algorithms using exponentially fewer random bits

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Pettie, Seth ^a,c   Ramachandran, Vijaya ^b,d  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c University of Michigan   (United States)

^d University of Texas at Austin   (United States)

Author keywords

Graph algorithms; Minimum spanning trees; Random sampling

Indexed keywords

GRAPH ALGORITHMS; MINIMUM SPANNING TREES; RANDOM SAMPLING;

ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; SENSITIVITY ANALYSIS;

TREES (MATHEMATICS);

EID: 42149192061     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328916     Document Type: Article

References (54)

1. AJTAI, M., KOMLÓS, J., AND SZEMERÉDI, E. 1987. Deterministic simulation in Logspace. In Proceedings of the Annual ACM Symposium on the Theory of Computation (STOC), 132-140.
2. BACH, E., AND SHALLTT, J. 1996. Algorithmic Number Theory. The MIT Press, Cambridge, MA.
3. BAR-NOY, A., MOTWANI, R., AND NAOR, J. 1992. A linear time approach to the set maxima problem. SIAM J. Discr. Math. 5, 1, 1-9.
4. BLUM, M., FLOYD, R. W., PRATT, V., RIVEST, R. L., AND TARJAN, R. E. 1973. Time bounds for selection. J. Comput. Syst. Sci. 7, 4, 448-461.
5. BORŮVKA, O. 1926. O jistém problému minimálním. Práce Moravské Pŕí rodovědecké Společnosti 3, 37-58. In Czech.
6. BUCHSBAUM, A. L., KAPLAN, H., ROGERS, A., AND WESTBROOK, J. R. 1998. Linear-Time pointer-machine algorithms for LCAs, MST verification, and dominators. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), 279-288.
7. CHAZELLE, B. 2000a. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47, 6, 1028-1047.
8. CHAZELLE, B. 2000b. The soft heap: An approximate priority queue with optimal error rate. J. ACM 47, 6, 1012-1027.
9. CHONG, K. W., HAN, Y., AND LAM, T. W. 2001. Concurrent threads and optimal parallel minimum spanning trees algorithm. J. ACM 48, 2, 297-323.
10. COHEN, A., AND WIGDERSON, A. 1989. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), 14-25.
11. COLE, R. 1999. Personal communication.
12. COLE, R., KLEIN, P. N., AND TARJAN, R. E. 1996. Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Proceedings of the Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 243-250.
13. COLE, R., AND VISHKIN, U. 1986. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), 478-491.
14. COLE, R. AND VISHKIN, U. 1991. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Inf. Comput. 92, 1, 1-47.
15. CORMEN, T. H., LEISERSON, C E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
16. CUNTO, W., AND MUNRO, J. I. 1989. Average case selection. J. ACM 36, 2, 270-279.
17. DUKSTRA, E. W. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269-271.
18. DIXON, B., RAUCH, M., AND TARJAN, R. E. 1992. Verification and sensitivity analysis of minimum. spanning trees in linear time. SIAM J. Comput. 21, 6, 1184-1192.
19. DOR, D., AND ZWICK, U. 2001. Median selection requires (2 + ε)n comparisons. SIAM J. Discr. Math. 14, 3, 312-325.
20. DOR, D., AND ZWICK, U. 1999. Selecting the median. SIAM J. Comput. 28, 5, 1722-1758.
21. FLOYD, R., AND RIVEST, R. 1975. Expected time bounds for selection. Commun. ACM 18, 3, 165-172.
22. GABOW, H. N., GALIL, Z., AND SPENCER, T. H. 1989. Efficient implementation of graph algorithms using contraction. J. ACM 36, 3, 540-572.
23. GABOW, H. N., GALIL, Z., SPENCER, T. H., AND TARJAN, R. E. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109-122.
24. GAZIT, H. 1991. An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput. 20, 6, 1046-1067.
25. GODDARD, W., KENYON, C., KING, V., AND SCHULMAN, L. 1993. Optimal randomized algorithms for local sorting and set-maxima. SIAM J. Comput. 22, 2, 272-283.
26. GRAHAM, R. L. AND HELL, P. 1985. On the history of the minimum spanning tree problem.. Ann. Hist. Comput. 7, 1, 43-57.
27. GRAHAM, R. L., YAO, A. C., AND YAO, F. F. 1980. Information bounds are weak in the shortest distance problem. J. ACM 27, 3, 428-444.
28. HALPERIN, S., AND ZWICK, U. 1996. An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. J. Comput. Syst. Sci. 53, 3, 395-416.
29. HALPERIN, S., AND ZWICK, U. 2001. Optimal randomized EREW PRAM algorithms for finding spanning forests. J. Algor. 39, 1, 1-46.
30. IMPAGLIAZZO, R., AND ZUCKERMAN, D. 1989. How to recycle random bits. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), 248-253.
31. JARNÍK, V. 1930. Ojistém problému minimálním. Práca Moravské Pří rodovědecké Společnosti 6,57-63. In Czech.
32. JOFFE, A. 1974. On a set of almost deterministic k-independent random variables. Ann. Probab. 2, 1, 161-162.
33. KARGER, D. R. 1993. Random sampling in matroids, with applications to graph connectivity and minimum spanning trees. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), 84-93.
34. KARGER, D. R., KLEIN, P. N., AND TARJAN, R. E. 1995. A randomized linear-time algorithm for finding minimum spanning trees. J. ACM 42, 321-329.
35. KARP, R. M., AND RAMACHANDRAN, V. 1990. Parallel algorithms for shared-memory machines. In Handbook of Computer Science. MIT Press/Elsevier, 869-942.
36. KENYON-MATHIEU, C., AND KING, V. 1989. Verifying partial orders. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), 367-374.
37. KING, V. 1997. A simpler minimum spanning tree verification algorithm.. Algorithmica 18, 2, 263-270.
38. KING, V., POON, C K., RAMACHANDRAN, V., AND SINHA, S. 1997. An optimal EREW PRAM algorithm for minimum spanning tree verification. Info. Proc. Lett. 62, 3, 153-159.
39. KOMLÓS, J. 1985. Linear verification for spanning trees. Combinatorica 5, 1, 57-65.
40. KRUSKAL, J. B. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Society, vol. 7, 48-50.
41. LIBERATORE, V. 1998. Matroid decomposition methods for the set maxima problem. In Proceedings of the Annual ACM/SIAM Symposium on Discrete Algorithm (SODA), 400-409.
42. MILLER, G. L. 1976. Riemann's hypothesis and tests for primality. J. Comput. Syst. Sci. 13, 3, 300-317.
43. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, New York.
44. PATERSON, A. S. M. S., AND PIPPENGER, N. 1976. Finding the median. J. Comput. Syst. Sci. 13, 184-199.
45. PETTIE, S. 2005. Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC), 964-973.
46. PETTIE, S. 2003. On the shortest path and minimum spanning tree-problems. Ph.D. thesis, The University of Texas at Austin. Also Tech. Rep. TR-03-35, Department of Computer Sciences. http://www.cs.utexas.edu/ftp/pub/ tech.reports/tr03-35.ps.gz.
47. PETTIE, S. 1999. Finding minimum, spanning trees in O(mα(m, n)) time. Tech. Rep. CS-TR-99-23, University of Texas, Austin.
48. PETTIE, S., AND RAMACHANDRAN, V. 2002a. Minimizing randomness in minimum spanning tree, parallel connectivity and set maxima algorithms. In Proceedings of the 13th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), 713-722.
49. PETTIE, S., AND RAMACHANDRAN, V. 2002b. An optimal minimum spanning tree algorithm. J. ACM 49, 1, 16-34.
50. PETTIE, S., AND RAMACHANDRAN, V. 2002C. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput. 31, 6, 1879-1895.
51. PRIM, R. C. 1957. Shortest connection networks and some generalizations. Bell Syst. Tech. J., 1389-1401.
52. RABIN, M. O. 1980. Probabilistic algorithm for testing primality. J. Number Theory 12,1, 128-138.
53. SCHMIDT, J. P., SIEGEL, A., AND SRINIVASAN, A. 1995. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discr. Math. 8, 2, 223-250.
54. TARJAN, R. E. 1982. Sensitivity analysis of minimum spanning trees and shortest path problems. Inf. Proc. Lett. 14, 1, 30-33. See Corrigendum, IPL 23, 4, 219.