Preemptive and Non-Preemptive Generalized Min Sum Set Cover.

Sungjin Im Maxim Sviridenko Ruben van der Zwaan

Published in: STACS (2012)

Keyphrases

set cover
scheduling problem
min sum
lower bound
np hard
approximation algorithms
greedy algorithm
high dimensional
special case
denoising
image denoising
convex hull
greedy heuristic