Structured randomized rounding and coloring

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

Volumn 2138, Issue , 2001, Pages 461-471

  Doerr, Benjamin ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Discrepancy; Hypergraph coloring; Integer linear programming; Randomized algorithms; Randomized rounding

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; INTEGER PROGRAMMING;

DISCREPANCY; HYPERGRAPH COLORING; INTEGER LINEAR PROGRAMMING; RANDOMIZED ALGORITHMS; RANDOMIZED ROUNDING;

COLORING;

EID: 84974674640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_53     Document Type: Conference Paper

References (15)

1. N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 2nd edition, 2000.
2. J. Beck and T. Fiala. “Integer making” theorems. Discrete Applied Mathematics, 3:1–8, 1981.
3. L. Babai, T. P. Hayes, and P. G. Kimmel. The cost of the missing bit: Communication complexity with help. In Proceedings of the 30th STOC, pages 673–682, 1998.
4. J. Beck and J. Spencer. Integral approximation sequences. Math. Programming, 30:88–98, 1984.
5. B. Chazelle. The Discrepancy Method. Princeton University, 2000.
6. V. Chvátal. The tail of the hypergeometric distribution. Discrete Math., 25:285–287, 1979.
7. B. Doerr and A. Srivastav. Recursive randomized coloring beats fair dice random colorings. In A. Ferreira and H. Reichel, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2001, volume 2010 of Lecture Notes in Computer Science, pages 183–194, Berlin–Heidelberg, 2001. Springer Verlag.
8. L. Lovász, J. Spencer, and K. Vesztergombi. Discrepancies of set-systems and matrices. Europ. J. Combin., 7:151–160, 1986.
9. J. Matoušek. Geometric Discrepancy. Springer-Verlag, Berlin, 1999
10. K. F. Roth. Remark concerning integer sequences. Acta Arithmetica, 9:257–260, 1964.
11. A. Srinivasan. An extension of the Lovász local lemma, and its applications to integer programming. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), pages 6–15, New York, 1996. ACM.
12. A. Srivastav. Derandomization in combinatorial optimization. In P. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, editors, Handbook of Randomization. Kluver, to appear in 2001.
13. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8:223–250, 1995.
14. W. Uhlmann. Vergleich der hypergeometrischen mit der Binomial- Verteilung. Metrika, 10:145–158, 1966.
15. B. L. van der Waerden. Beweis einer Baudetschen Vermutung. Nieuw Arch. Wsk., 15:212–216, 1927