Faster Approximation Algorithms for Geometric Set Cover.
Timothy M. ChanQizheng HePublished in: CoRR (2020)
Keyphrases
- set cover
- approximation algorithms
- np hard
- greedy heuristics
- special case
- worst case
- vertex cover
- approximation ratio
- minimum cost
- approximation schemes
- primal dual
- open shop
- undirected graph
- randomized algorithms
- constant factor approximation
- greedy algorithm
- precedence constraints
- combinatorial auctions
- integer programming
- evolutionary algorithm
- association rules
- optimal solution