An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem
Bundit LaekhanukitPublished in: CoRR (2011)
Keyphrases
- minimum cost
- np hard
- approximation ratio
- optimal solution
- matching algorithm
- objective function
- approximation algorithms
- search space
- computational complexity
- dynamic programming
- spanning tree
- network flow problem
- simulated annealing
- similarity measure
- network flow
- minimum cost flow
- approximation guarantees
- network simplex algorithm
- undirected graph
- convex hull
- metaheuristic
- special case