A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.

Refael Hassin Asaf Levin

Published in: SIAM J. Comput. (2005)

Keyphrases

set cover
greedy approximation algorithm
greedy algorithm
np hard
greedy heuristics
minimum cost
approximation algorithms
greedy heuristic
greedy algorithms
network flow
influence spread
knapsack problem
worst case
dynamic programming
influence maximization
objective function
optimal solution
scheduling problem