Reachability Preservers: New Extremal Bounds and Approximation Algorithms.
Amir AbboudGreg BodwinPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- worst case
- constant factor
- randomized algorithms
- np hard
- lower bound
- upper bound
- special case
- vertex cover
- approximation guarantees
- facility location problem
- primal dual
- network design problem
- minimum cost
- average case
- approximation ratio
- state space
- open shop
- error bounds
- lower and upper bounds
- upper and lower bounds
- np hardness
- precedence constraints
- disjoint paths
- learning algorithm
- approximation schemes
- greedy algorithm
- optimal solution