2 papers
cs.DS2026
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
Amey Bhangale, Yezhou Zhang
We study the \emph{generalized min-sum set cover} (GMSSC) problem, where given a collection of hyperedges with arbitrary covering requirements $\{k_e \in \mathbb{Z}^+ : e \in E…
cs.CC2026
Optimal Inapproximability of Generalized Linear Equations over a Finite Group
Amey Bhangale, Yezhou Zhang
Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to f…