approximation to the minimum rooted star cover problem

Fudan Univ, Software Sch, Univ Leeds, Univ WisconsinIn this paper, we study the following minimum rooted star cover problem: given a complete graph G = (V, E) with a length function l : E -> Z(+) that satisfies the triangle inequality, a designated root vertex r is an element of V, and a lengt