Tight Approximation Algorithms for Ordered Covering.
Jatin BatraSyamantak DasAgastya Vibhuti JhaPublished in: WADS (2023)
Keyphrases
- approximation algorithms
- worst case
- np hard
- lower bound
- upper bound
- special case
- vertex cover
- facility location problem
- np hardness
- exact algorithms
- primal dual
- minimum cost
- set cover
- approximation ratio
- network design problem
- greedy algorithm
- approximation schemes
- open shop
- precedence constraints
- undirected graph
- error bounds
- randomized algorithms
- search algorithm
- partially ordered
- greedy heuristic
- linear programming
- computational complexity
- constant factor
- optimal solution
- learning algorithm