A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Guy KortsarzZeev NutovPublished in: CoRR (2015)
Keyphrases
- k means
- computational cost
- search space
- learning algorithm
- computational complexity
- dynamic programming
- preprocessing
- undirected graph
- matching algorithm
- vertex set
- graph based algorithm
- maximum flow
- graph search
- minimum spanning tree
- weighted graph
- detection algorithm
- segmentation algorithm
- probabilistic model
- np hard
- cost function
- graph structure
- error bounds
- spanning tree
- shortest path problem
- edge detection