3 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.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 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 , a -star (-star, -star, respectively) is a connected graph containing a degree- vertex and degree- vertices, where $\e…