Mengyuan Hu

collaborators

2 papers

cs.DS2026

Covering vertices by sequential stars

Mengyuan Hu, An Zhang, Yong Chen +5

We study the problem of covering the maximum number of vertices in a graph by a collection of vertex-disjoint stars, each with a number of satellites in a given interval $[k, \ell]…

cs.DS2024

Approximation algorithms for non-sequential star packing problems

Mengyuan Hu, An Zhang, Yong Chen +2

For a positive integer $k \geq 1$ , a $k$ -star ( $k^{+}$ -star, $k^{-}$ -star, respectively) is a connected graph containing a degree- $ℓ$ vertex and $ℓ$ degree- $1$ vertices, where $\e…