Xingfu Li

most citedA 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices

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

collaborators

2 papers

math.CO2021★ 1 cited

On the computational complexity of the Steiner $k$ -eccentricity

Xingfu Li, Guihai Yu, Aleksandar Ilić +1

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . A linear time algorithm for calculati…

cs.DS2014★ 1 cited

A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices

Xingfu Li, Daming Zhu

This paper focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a…

On the computational complexity of the Steiner k-eccentricity

A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices

On the computational complexity of the Steiner $k$ -eccentricity