Absolute o(log m) error in approximating random set covering: an average case analysis
暂无分享,去创建一个
[1] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[2] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[3] Giorgio Gambosi,et al. Preserving Approximation in the Min-Weighted Set Cover Problem , 1997, Discret. Appl. Math..
[4] Carlo Vercellis,et al. A probabilistic analysis of the set covering problem , 1984, Ann. Oper. Res..
[5] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[6] V. Paschos. A survey of approximately optimal solutions to some covering and packing problems , 1997, CSUR.
[7] M. V. Koutrasa,et al. Evaluation of reliability bounds by set covering models , 2002 .
[8] Vassilis Zissimopoulos,et al. Evaluation of reliability bounds by set covering models , 2003 .
[9] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[10] Carlo Vercellis. A probabilistic analysis of the set covering problem , 1984, Ann. Oper. Res..
[11] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.
[12] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[13] Elena Marchiori,et al. An Iterated Heuristic Algorithm for the Set Covering Problem , 1998, WAE.
[14] B. Weide. Statistical methods in algorithm design and analysis. , 1978 .