An Zhang

activity

20242026

collaborators

4 papers

cs.DS2026

Layering and reverse extension for weighted $k$ -path vertex cover

Jiajing Wu, An Zhang, Shiming Li +1

We study the weighted $k$ -path vertex cover problem for any fixed integer $k \geq 2$ , in which a vertex non-negatively weighted simple graph $G = (V, E)$ is given and one wants to f…

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.GT2025

Maximizing social welfare among EF1 allocations at the presence of two types of agents

Jiaxuan Ma, Yong Chen, Guangting Chen +3

We study the fair allocation of indivisible items to $n$ agents to maximize the utilitarian social welfare, where the fairness criterion is envy-free up to one item and there are o…

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…

Layering and reverse extension for weighted k-path vertex cover

Covering vertices by sequential stars

Maximizing social welfare among EF1 allocations at the presence of two types of agents

Approximation algorithms for non-sequential star packing problems

Layering and reverse extension for weighted $k$ -path vertex cover