8 citations · 12 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 1 cited
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities
Mong-Jen Kao, Hai-Lun Tu, D. T. Lee
We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph with a maximum edge size . Each e…
cs.DS2016
Iterative Partial Rounding for Vertex Cover with Hard Capacities
Mong-Jen Kao
We provide a simple and novel algorithmic design technique, for which we call iterative partial rounding, that gives a tight rounding-based approximation for vertex cover with hard…