An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.
Julia ChuzhoySanjeev KhannaPublished in: FOCS (2009)
Keyphrases
- worst case
- preprocessing
- detection algorithm
- learning algorithm
- optimal solution
- segmentation algorithm
- computational complexity
- dynamic programming
- computational cost
- clustering method
- high accuracy
- optimization algorithm
- computationally efficient
- expectation maximization
- times faster
- recognition algorithm
- neural network
- similarity measure
- matching algorithm
- convergence rate
- approximation ratio
- theoretical analysis
- graph cuts
- particle swarm optimization
- simulated annealing
- probabilistic model
- special case
- lower bound