-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem.
Jittat FakcharoenpholBundit LaekhanukitPublished in: SIAM J. Comput. (2012)
Keyphrases
- cost function
- probabilistic model
- error bounds
- search space
- dynamic programming
- preprocessing
- simulated annealing
- significant improvement
- computational complexity
- times faster
- learning algorithm
- closed form
- detection algorithm
- neural network
- segmentation algorithm
- expectation maximization
- recognition algorithm
- linear programming
- high accuracy
- k means
- optimal solution
- image sequences
- experimental evaluation
- ant colony optimization
- tree structure
- association rules
- similarity measure