Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
SODA, pp. 998-1005, 2021.
We study the generalized min sum set cover (GMSSC) problem, wherein given a collection of hyperedges $E$ with arbitrary covering requirements $k_e$, the goal is to find an ordering of the vertices to minimize the total cover time of the hyperedges; a hyperedge $e$ is considered covered by the first time when $k_e$ many of its vertices a...More
PPT (Upload PPT)