Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover

Jatin Batra
Jatin Batra
Majid Farhadi
Majid Farhadi

SODA, pp. 998-1005, 2021.

Cited by: 1|Views1
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments