Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.
Sayan BhattacharyaMonika HenzingerDanupon NanongkaiXiaowei WuPublished in: SIAM J. Comput. (2023)
Keyphrases
- set cover
- approximation algorithms
- randomized algorithms
- np hard
- greedy heuristics
- special case
- greedy algorithm
- worst case
- vertex cover
- minimum cost
- network flow
- primal dual
- approximation ratio
- open shop
- greedy heuristic
- undirected graph
- approximation guarantees
- convex hull
- precedence constraints
- genetic algorithm
- combinatorial auctions
- upper bound
- evolutionary algorithm
- association rules