8 citations · 12 across the 9 of their papers we have counts for
Showing cs.DMShow 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.DM2010★ 8 cited
Approximation Algorithms for the Capacitated Domination Problem
Mong-Jen Kao, Han-Lin Chen
We consider the {\em Capacitated Domination} problem, which models a service-requirement assignment scenario and is also a generalization of the well-known {\em Dominating Set} pro…