A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set.
Guy EvenJon FeldmanGuy KortsarzZeev NutovPublished in: RANDOM-APPROX (2001)
Keyphrases
- undirected graph
- vertex set
- graph connectivity
- weighted graph
- initial set
- dynamic programming
- graph structure
- objective function
- polynomial time complexity
- strongly connected
- input data
- search space
- connected components
- directed graph
- np hard
- k means
- computational complexity
- attributed graphs
- gray value
- edge weights
- worst case
- detection algorithm
- simulated annealing
- segmentation algorithm
- graph model
- matching algorithm
- convex hull
- approximation algorithms
- learning algorithm
- edge points
- constant factor
- error bounds
- graph based algorithm
- polynomial time approximation
- edge detection algorithm
- hamiltonian cycle
- selected subset
- expectation maximization
- minimum cost