Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 350-368

  Panconesi, Alessandro ^a   Srinivasan, Aravind ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Chernoff Hoeffding bounds; Correlation inequalities; Distributed algorithms; Edge coloring; Large deviations; Parallel algorithms; Probabilistic algorithms; Stochastic dependence; correlation

Indexed keywords

EID: 0006630131     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793250767     Document Type: Article

References (24)

1. N. ALON, J. SPENCER, AND P. ERDOS, The Probabilistic Method, Wiley-Interscience Series, John Wiley, New York, 1992.
2. c n)-wise independence in NC, J. Assoc. Comput. Mach., 38 (1991), pp. 1026-1046.
3. B. BOLLOBÁS, Graph Theory, Springer-Verlag, New York, 1979.
4. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
5. X. DENG AND P. DYMOND, Minimizing communication phases in optimal parallel algorithms, Technical Report 94-04, Department of Computer Science, York University, North York, ON, Canada, 1994.
6. D. DUBHASHI AND A. PANCONESI, Near-optimal distributed edge coloring, in Proc. 3rd Annual European Symposium on Algorithms (ESA '95), Lecture Notes in Comput. Sci. 979, Springer-Verlag, Berlin, 1995, pp. 448-459.
7. D. DUBHASHI AND D. RANJAN, Balls and bins: A study in correlations, Technical Report RS-96-25, Basic Research in Computer Science (BRICS), University of Århus, Århus, Denmark, submitted.
8. W. HOEFFDING, Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J., 58 (1963), pp. 13-30.
9. R. JAIN, K. SOMALWAR, J. WERTH, AND J. C. BROWNE, Scheduling parallel I/O operations in multiple bus systems, J. Parallel Distrib. Comput., 16 (1992), pp. 352-362.
10. H. J. KARLOFF AND D. B. SHMOYS, Efficient parallel algorithms for edge coloring problems, J. Algorithms, 8 (1987), pp. 39-52.
11. G. F. LEV, N. PIPPENGER, AND L. G. VALIANT, A fast parallel algorithm for routing in permutation networks, IEEE Trans. Comput., 30 (1981), pp. 93-100.
12. N. LINIAL, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), pp. 193-201.
13. M. LUBY, Removing randomness in parallel computation without a processor penalty, J. Comput. System Sci., 47 (1993), pp. 250-286.
14. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics, London Math. Soc. Lecture Notes Ser. 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
15. R. MOTWANI, J. NAOR, AND M. NAOR, The probabilistic method yields deterministic parallel algorithms, J. Comput. System Sci., 49 (1994), pp. 478-516.
16. A. PANCONESI AND A. SRINIVASAN, Fast randomized algorithms for distributed edge coloring, in Proc. ACM Symposium on Principles of Distributed Computing, ACM, New York, 1992, pp. 251-262.
17. A. PANCONESI AND A. SRINIVASAN, Improved distributed algorithms for coloring and network decomposition problems, in Proc. ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 581-592.
18. P. RAGHAVAN, Lecture notes on randomized algorithms, Technical Report RC 15340 (#68237), IBM T. J. Watson Research Center, Yorktown Heights, NY, 1990.
19. R. RAMAN, The power of collision: Randomized parallel algorithms for chaining and integer sorting, in Proc. 10th Annual Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 472, Springer-Verlag, Berlin, 1990, pp. 161-175; also available as Technical Report 336, Department of Computer Science, University of Rochester, Rochester, NY, 1990 (revised 1991).
20. R. RAMAN, The power of collision: Randomized parallel algorithms for chaining and integer sorting, in Proc. 10th Annual Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 472, Springer-Verlag, Berlin, 1990, pp. 161-175; also available as Technical Report 336, Department of Computer Science, University of Rochester, Rochester, NY, 1990 (revised 1991).
21. J. P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math., 8 (1995), pp. 223-250.
22. A. SRINIVASAN, On the distribution of the number of prime factors of integers, manuscript, 1993.
23. V. G. VIZING, On an estimate of the chromatic class of a p-graph, Diskret. Anal., 3 (1964), pp. 25-30 (in Russian).
24. N. YOUNG, Randomized rounding without solving the linear program, in Proc. ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 170-178.