3 papers
cs.DS2026
-Clustering via Iterative Randomized Rounding
JarosÅaw Byrka, Yuhao Guo, Yang Hu +3
In this work we propose a single rounding algorithm for the fractional solutions of the standard LP relaxation for -clustering. As a starting point, we obtain an iterative round…
cs.GT2025
Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
Xiaohui Bei, Yuda Feng, Yang Hu +2
We study the problem of allocating items to agents with submodular valuations with the goal of maximizing the weighted Nash social welfare (NSW). The best-known results for unweigh…
cs.GT2025
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
Yuda Feng, Yang Hu, Shi Li +1
We study the problem of assigning items to agents so as to maximize the \emph{weighted} Nash Social Welfare (NSW) under submodular valuations. The best-known result for the problem…