Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

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

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.6K citations

Computing, Computer Science, Algorithms +11

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text

Computing, Computer Science, Mathematics +14