k)-approximation algorithm for the k-vertex connected spanning subgraph problem.
Jittat FakcharoenpholBundit LaekhanukitPublished in: STOC (2008)
Keyphrases
- dynamic programming
- optimization algorithm
- experimental evaluation
- computational complexity
- preprocessing
- search space
- detection algorithm
- cost function
- learning algorithm
- objective function
- significant improvement
- simulated annealing
- k means
- times faster
- matching algorithm
- theoretical analysis
- tree structure
- approximation ratio
- closed form
- hamiltonian cycle
- clustering method
- segmentation algorithm
- expectation maximization
- worst case
- computational cost
- multi objective
- data structure