Minimum Sum Set Cover: Structures and Algorithm

Zhongyi Zhang, Yixin Cao

A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the positi…