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