13 citations · 17 across the 5 of their papers we have counts for
1 paper · 2 filters
Marek Karpinski, Richard Schmied, Claus Viehmann
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.