Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle.
Waldo GálvezFrancisco Sanhueza-MatamalaJosé A. SotoPublished in: WAOA (2021)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- triangle mesh
- network design problem
- primal dual
- disjoint paths
- facility location problem
- connected components
- precedence constraints
- open shop
- lower bound
- np hardness
- set cover
- exact algorithms
- approximation ratio
- constant factor
- minimum weight
- randomized algorithms
- combinatorial auctions