Guohui Lin

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

An improved local search based algorithm for $k^{-}$ -star partition

Mingyang Gong, Guohui Lin, Brendan Mumey

We study the $k^{-}$ -star partition problem that aims to find a minimum collection of vertex-disjoint stars, each having at most $k$ vertices to cover all vertices in a simple undire…

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…

An improved local search based algorithm for k−-star partition

Approximation algorithms for non-sequential star packing problems

An improved local search based algorithm for $k^{-}$ -star partition