# zbMATH — the first resource for mathematics

A threshold of $$\ln n$$ for approximating set cover. (English) Zbl 0922.68067
Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22–24, 1996. New York, NY: ACM, 314-318 (1996).

##### MSC:
 68W10 Parallel algorithms in computer science
greedy algorithm