Approximation algorithms for flexible graph connectivity.
Sylvia C. BoydJoseph CheriyanArash HaddadanSharat IbrahimpurPublished in: Math. Program. (2024)
Keyphrases
- approximation algorithms
- graph connectivity
- special case
- np hard
- worst case
- vertex cover
- facility location problem
- approximation ratio
- minimum cost
- np hardness
- primal dual
- randomized algorithms
- network design problem
- set cover
- approximation schemes
- open shop
- precedence constraints
- polynomial time approximation
- constant factor
- approximation guarantees
- bayesian networks