A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.
Guy KortsarzZeev NutovPublished in: ACM Trans. Algorithms (2016)
Keyphrases
- learning algorithm
- graph structure
- detection algorithm
- np hard
- dynamic programming
- graph based algorithm
- objective function
- closed form
- computational cost
- worst case
- approximation ratio
- graph model
- maximum flow
- error bounds
- segmentation algorithm
- simulated annealing
- edge detection
- cost function
- k means
- search space
- computational complexity
- optimal solution
- randomized algorithm
- polynomial time approximation
- undirected graph
- weighted graph
- approximation algorithms
- particle swarm optimization
- preprocessing