An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.
Joseph CheriyanSantosh S. VempalaAdrian VettaPublished in: SIAM J. Comput. (2003)
Keyphrases
- np hard
- minimum cost
- approximation ratio
- search space
- computational complexity
- dynamic programming
- undirected graph
- optimal solution
- approximation algorithms
- objective function
- weight function
- integer programming
- similarity measure
- combinatorial optimization
- simulated annealing
- network flow
- string matching
- special case