Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 322-331
- https://doi.org/10.1109/sfcs.1993.366855
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex CoversJournal of Algorithms, 1994
- A parallel approximation algorithm for positive linear programmingPublished by Association for Computing Machinery (ACM) ,1993
- On the hardness of approximating minimization problemsPublished by Association for Computing Machinery (ACM) ,1993
- A primal-dual approximation algorithm for generalized Steiner network problemsPublished by Association for Computing Machinery (ACM) ,1993
- Efficient NC algorithms for set cover with applications to learning and geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979