Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
New Convex Programming Technique for Nash Social Welfare and Scheduling
Yuda Feng, Weijiang Hu, Shi Li
We propose a new convex programming relaxation for the weighted Nash social welfare (NSW) problem that achieves a matching -approximation via the rounding a…
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.DS2025
Logarithmic Approximations for Fair k-Set Selection
Shi Li, Chenyang Xu, Ruilong Zhang
We study the fair k-set selection problem where we aim to select sets from a given set system such that the (weighted) occurrence times that each element appears in these s…