Approximation hardness of edge dominating set problems

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

Approximating clique is almost NP-complete

Uriel Feige, S. Goldwasser, László Lovász et al. · 2002 · 397 citations

Computing, Computer Science, Algorithms +15

Edge Dominating Sets in Graphs

Mihalis Yannakakis, Fǎnicǎ Gavril · SIAM Journal on Applied Mathematics · 1980 · 391 citations

Natural Sciences, Computer Science, Mathematics +9

The importance of being biased

Irit Dinur · 2002 · 218 citations

Computing, Computer Science, Mathematics +14

Minimum Edge Dominating Sets

Joseph D. Horton, K. Kilakos · SIAM Journal on Discrete Mathematics · 1993 · 121 citations

Natural Sciences, Mathematics, Combinatorics +12