Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1991 · 1.7K citations

Computing, Computer Science, Mathematics +12

Complexity and approximation: Combinatorial optimization problems and their approximability properties

Computers & Mathematics with Applications · 2000 · 1.3K citations

Computing, Computer Science, Mathematics +13

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

On the Structure of Polynomial Time Reducibility

Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text

Computing, Computer Science, Algorithms +5

The Traveling Salesman Problem with Distances One and Two

Christos H. Papadimitriou, Mihalis Yannakakis · Mathematics of Operations Research · 1993 · 417 citations

Computing, Computer Science, Mathematics +12