2 citations · 3 across the 3 of their papers we have counts for
3 papers
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.CG2013
Optimal Time-Convex Hull under the Lp Metrics
Bang-Sin Dai, Mong-Jen Kao, D. T. Lee
We consider the problem of computing the time-convex hull of a point set under the general metric in the presence of a straight-line highway in the plane. The traveling speed…
cs.DS2011★ 2 cited
Capacitated Domination: Constant Factor Approximation for Planar Graphs
Mong-Jen Kao, D. T. Lee
We consider the capacitated domination problem, which models a service-requirement assigning scenario and which is also a generalization of the dominating set problem. In this prob…