Preserving Approximation in the Min-Weighted Set Cover Problem.

Giorgio Gambosi Marco Protasi Maurizio Talamo

Published in: Discret. Appl. Math. (1997)

Keyphrases

set cover
approximation algorithms
greedy algorithm
np hard
greedy heuristics
special case
weight function
network flow
minimum cost
worst case
solution space
greedy heuristic
primal dual
data sets
optimal solution
knapsack problem
scheduling problem
image processing