Equitable coloring extends chernoff-hoeffding bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 285-296

  Pemmaraju, Sriram V ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES; RANDOM VARIABLES; TREES (MATHEMATICS);

CONCENTRATION INEQUALITY; DEPENDENCY STRUCTURES; EQUITABLE COLORING; EXTREMAL GRAPH THEORY; INDEPENDENT RANDOM VARIABLES; MUTUALLY INDEPENDENTS; OUTERPLANAR GRAPH; SUMS OF RANDOM VARIABLES;

APPROXIMATION ALGORITHMS;

EID: 84923084498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (11)

1. Béla Bollobás. The chromatic number of random graphs. Combinatorica, 8:49–55, 1988.
2. Bela Bollobás and Richard K. Guy. Equitable and proportional coloring of trees. Journal of Combinatorial Theory, Series B, 34:177–186, 1983.
3. Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493–507, 1952.
4. Hajnal and Szeméredi. Proof of a conjecture of erdös. In P. Erdoös, A. Rényi, and V.T. Sós, editors, Combinatorial Theory and Its Applications, Vol II, Volume 4 of Colloquia Mathematica Societatis János Bolyai, pages 601–623. North-Holland, 1970.
5. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13–30, 1963.
6. Colin McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195–248. Springer, 1998.
7. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
8. Alessandro Panconesi and Aravind Srinivasan. Randomized distributed edge colouring via an extension of the chernoff-hoeffding bounds. SIAM Journal on Computing, 26(2):350–368, 1997.
9. Sriram V.Pemmaraju. Equitable colorings, proportional colorings, and chernoffhoeffding bounds. Technical report, TR 01-05 Department of Computer Science, The University of Iowa, 2001.
10. Jeanette Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223–250, 1995.
11. Joel Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, 1987.