A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Guy EvenJon FeldmanGuy KortsarzZeev NutovPublished in: ACM Trans. Algorithms (2009)
Keyphrases
- learning algorithm
- graph based algorithm
- computational cost
- matching algorithm
- shortest path problem
- preprocessing
- k means
- cost function
- weighted graph
- dynamic programming
- segmentation algorithm
- detection algorithm
- strongly connected
- spanning tree
- closed form
- optimal solution
- computational complexity
- particle swarm optimization
- worst case
- maximum flow
- minimum spanning tree
- polynomial time approximation
- error bounds
- tree structure
- simulated annealing
- np hard
- search space
- similarity measure
- clustering algorithm