Reachability Preservers: New Extremal Bounds and Approximation Algorithms.
Amir AbboudGreg BodwinPublished in: SIAM J. Comput. (2024)
Keyphrases
- approximation algorithms
- worst case
- randomized algorithms
- constant factor
- np hard
- special case
- upper bound
- lower bound
- approximation guarantees
- minimum cost
- facility location problem
- open shop
- vertex cover
- network design problem
- approximation ratio
- state space
- average case
- set cover
- approximation schemes
- precedence constraints
- error bounds
- upper and lower bounds
- lower and upper bounds
- primal dual
- greedy algorithm
- undirected graph
- search algorithm