Faster Approximation Algorithms for Geometric Set Cover.
Timothy M. ChanQizheng HePublished in: SoCG (2020)
Keyphrases
- set cover
- approximation algorithms
- np hard
- greedy heuristics
- special case
- worst case
- vertex cover
- minimum cost
- greedy algorithm
- primal dual
- precedence constraints
- approximation ratio
- open shop
- randomized algorithms
- scheduling problem
- genetic algorithm
- approximation schemes
- constant factor
- data structure
- objective function
- search algorithm
- network flow
- undirected graph
- dynamic programming
- constraint satisfaction problems
- np complete