An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem.

Bundit Laekhanukit

Published in: Algorithmica (2015)

Keyphrases

minimum cost
np hard
dynamic programming
approximation ratio
computational complexity
network flow
objective function
simulated annealing
approximation algorithms
search space
worst case
linear programming
integer programming
similarity measure
optimal solution
convergence rate