Calculating approximation guarantees for partial set cover of pairs.
Peter DamaschkePublished in: Optim. Lett. (2017)
Keyphrases
- set cover
- approximation guarantees
- greedy algorithm
- approximation algorithms
- np hard
- greedy heuristics
- special case
- worst case
- greedy heuristic
- greedy algorithms
- approximation ratio
- minimum cost
- primal dual
- network flow
- knapsack problem
- objective function
- dynamic programming
- constant factor
- np complete
- image restoration
- computational complexity