3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2016
Tighter inapproximability for set cover
David G. Harris
Set Cover is a classic NP-hard problem; as shown by Slavík (1997) the greedy algorithm gives an approximation ratio of . A series of works by Lund \& Yann…
cs.DS2014★ 3 cited
On Computing Maximal Independent Sets of Hypergraphs in Parallel
Ioana O. Bercea, Navin Goyal, David G. Harris +1
Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the w…