A Threshold of ln n for Approximating Set Cover (1998)

by Uriel Feige
Venue:JOURNAL OF THE ACM
Citations:622 - 6 self

Documents Related by Co-Citation

10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
682 Approximation Algorithms for Combinatorial Problems – D S Johnson - 1974
260 On the ratio of optimal integral and fractional covers – L Lovász - 1975
390 On the hardness of approximating minimization problems – C Lund, M Yannakakis - 1994
577 Optimization, approximation and complexity classes – C Papadimitriou, M Yannakakis - 1991
648 Some optimal inapproximability results – Johan Håstad - 2002
277 Approximation Algorithms for Connected Dominating Sets – Sudipto Guha, Samir Khuller - 1996
105 Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms – G Cornuejols, L Fisher, G L Nemhauser - 1977
365 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
1439 Reducibility among combinatorial problems – R M Karp - 1972
33 Approximating the independence number via the `-function – N Alon, N Kahale - 1994
307 On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks – Jie Wu, et al. - 1999
117 The Budgeted Maximum Coverage Problem – Samir Khuller, Anna Moss, Joseph (Seffi) Naor - 1997
7 Heuristics for the cost median problem – D S Hochbaum - 1982
36 Primal-dual rnc approximation algorithms for set cover and covering integer programs – S Rajagopalan, V Vazirani - 1998
36 Efficient NC-algorithms for set cover with applications to learning and geometry – B Berger, J Rompel, P Shot - 1989
86 An Efficient Distributed Algorithm for Constructing Small Dominating Sets – Lujun Jia, Rajmohan Rajaraman, Torsten Suel - 2001
372 A Greedy Heuristic for the Set-Covering Problem – V Chvatal
365 The ellipsoid method and its consequences in combinatorial optimization – M Grotschel, L Lovasz, A Schrijver - 1981