Dynamic ((1+ε)ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set.
Shay SolomonAmitai UzradPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- set cover
- facility location problem
- dominating set
- connected dominating set
- minimum cost
- greedy heuristics
- np hard
- constant factor
- special case
- worst case
- vertex cover
- primal dual
- network flow
- randomized algorithms
- upper bound
- approximation ratio
- greedy algorithm
- optimal solution
- mathematical model
- computational complexity