Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

Unit disk graphs

Brent N. Clark, Charles J. Colbourn, David Johnson · Discrete Mathematics · 1990 · 1.4K citations

Approximation algorithms for NP-complete problems on planar graphs

Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text

Computing, Computer Science, Mathematics +15

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

Ran Raz · 1997 · 842 citations

Natural Sciences, Computer Science, Fault Tolerance +5

The NP-completeness column: An ongoing guide

David S. Johnson · Journal of Algorithms · 1986 · 803 citations

Computing, Computer Science, Algorithms +9

Approximation schemes for covering and packing problems in image processing and VLSI

Dorit S. Hochbaum, Wolfgang Maass · Journal of the ACM · 1985 · 750 citations · Full text

Computing, Computer Science, Algorithms +14