An O(log n)-approximation for the Set Cover Problem with Set Ownership

Mira Gonen Yuval Shavitt

Published in: CoRR (2008)

Keyphrases

set cover
approximation algorithms
network flow
greedy algorithm
greedy heuristics
special case
np hard
lower bound
convex hull