Hai-Lun Tu

most citedO(f) Bi-Approximation for Capacitated Covering with Hard Capacities

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

collaborators

2 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 $G = (V, E)$ with a maximum edge size $f$ . Each e…

cs.DS2014

Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs

Ching-Chi Lin, Hai-Lun Tu

In a graph $G$ , a vertex subset $S \subseteq V (G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$ . A dominating set $S$ of a graph $…