Equitable colorings extend Chernoff-Hoeffding bounds

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 924-925

  Pemmaraju, Sriram V ^a  

^a University of Iowa   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 0038438587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Bela Bollobas and Richard K. Guy. Eguitable and proportional coloring of trees. Journal of Combinatorial Theory, Series B, 34:177-186, 1983.
2. A. Hajnal and E. Szemeredi. Proof of a conjecture of Erdos. In P. Erdos, A. Renyi, and V.T. Sos, editors, Combinatorial Theory and Its Applications, Vol II, Volume 4 of Colloquia Mathematica Societatis Janos Bolyai, pages 601-623. North-Holland, 1970.
3. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13-30, 1963.
4. Rajeev Motwani, Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995