Yong Chen

activity

20242026

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems

Lin Chen, Tingwei Hu, Yuchen Mao +5

In the bottleneck multiple knapsack problem, we are given a set of items and a set of knapsacks, where each item has a profit and a weight, and each knapsack has a capacity. Our go…

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…