Structured Randomized Rounding and Coloring
暂无分享,去创建一个
[1] Vasek Chvátal,et al. The tail of the hypergeometric distribution , 1979, Discret. Math..
[2] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[3] Bernard Chazelle,et al. The Discrepancy Method , 1998, ISAAC.
[4] Aravind Srinivasan,et al. Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.
[5] W. Uhlmann. Vergleich der hypergeometrischen mit der Binomial-Verteilung , 1966 .
[6] László Lovász,et al. Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..
[7] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..
[8] Anand Srivastav,et al. Derandomization in Combinatorial Optimization , 2001 .
[9] Joel H. Spencer,et al. Integral approximation sequences , 1984, Math. Program..
[10] K. F. Roth. Remark concerning integer sequences , 1964 .
[11] Thomas P. Hayes,et al. The Cost of the Missing Bit: Communication Complexity with Help , 2001, Comb..
[12] Anand Srivastav,et al. Recursive Randomized Coloring Beats Fair Dice Random Colorings , 2001, STACS.
[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[14] Aravind Srinivasan,et al. An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.