Approximation Algorithms for Flexible Graph Connectivity.
Sylvia C. BoydJoseph CheriyanArash HaddadanSharat IbrahimpurPublished in: FSTTCS (2021)
Keyphrases
- approximation algorithms
- graph connectivity
- np hard
- worst case
- special case
- vertex cover
- minimum cost
- facility location problem
- set cover
- approximation ratio
- primal dual
- network design problem
- np hardness
- constant factor
- combinatorial auctions
- randomized algorithms
- approximation schemes
- disjoint paths
- approximation guarantees
- objective function
- domain independent
- polynomial time approximation
- undirected graph
- integer programming