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