most citedApproximations of the Densest k-Subhypergraph and Set Union Knapsack problems

15 citations · 15 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2019

Linearly-growing Reductions of Karp's 21 NP-complete Problems

Jerzy A Filar, Michael Haythorpe, Richard Taylor

We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a smaller number of kernel NP-complete problems. In partic…

cs.DS2016★ 15 cited

Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems

Richard Taylor

For any given we provide an algorithm for the Densest -Subhypergraph Problem with an approximation ratio of at most for $θ_m=\frac{1}{2}m-\frac{1}{2}-\frac…