Primal-dual schema for capacitated covering problems

A Greedy Heuristic for the Set-Covering Problem

Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations

Natural Sciences, Computer Science, Mathematics +17

A General Approximation Technique for Constrained Forest Problems

Michel X. Goemans, David P. Williamson · SIAM Journal on Computing · 1995 · 849 citations

Computing, Computer Science, Algorithms +14

A linear-time approximation algorithm for the weighted vertex cover problem

Reuven Bar-Yehuda, Shimon Even · Journal of Algorithms · 1981 · 433 citations

Computing, Computer Science, Algorithms +8

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Ajit Agrawal, Philip N. Klein, R. Ravi · SIAM Journal on Computing · 1995 · 420 citations

Computing, Computer Science, Mathematics +11

A unified approach to approximating resource allocation and scheduling

Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund et al. · Journal of the ACM · 2001 · 411 citations

Computing, Computer Science, Computer Systems +17