论文信息 - Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for the generalizations considered in this paper.

Vijay V. Vazirani | Sridhar Rajagopalan | V. Vazirani | S. Rajagopalan

[1] Gregory Dobson,et al. Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[2] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[3] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[4] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[5] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[6] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[7] E T. Leighton,et al. Introduction to parallel algorithms and architectures , 1991 .

[8] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.

[9] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.

[10] Uriel Feige. A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[11] Bonnie Berger,et al. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..

[12] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.