Mingyang Gong

collaborators

3 papers

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…

cs.DS2024

Approximately covering vertices by order- $5$ or longer paths

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1

This paper studies $M P C_{v}^{5 +}$ , which is to cover as many vertices as possible in a given graph $G = (V, E)$ by vertex-disjoint $5^{+}$ -paths (i.e., paths each with at least five verti…

cs.DS2023

An Approximation Algorithm for Covering Vertices by 4^+-Paths

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1

This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of v…

Approximation algorithms for non-sequential star packing problems

Approximately covering vertices by order-5 or longer paths

An Approximation Algorithm for Covering Vertices by 4^+-Paths

Approximately covering vertices by order- $5$ or longer paths