A Tight Analysis of the Greedy Algorithm for Set Cover.

Published in: STOC (1996)

Keyphrases

greedy algorithm
set cover
worst case
greedy heuristics
np hard
greedy algorithms
greedy heuristic
approximation algorithms
lower bound
dynamic programming
knapsack problem
objective function
network flow
randomized algorithm
influence maximization
integer programming
scheduling problem