A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph.
Satoshi TaokaToshiya MashimaToshimasa WatanabePublished in: ISCAS (3) (2003)
Keyphrases
- undirected graph
- weighted graph
- vertex set
- hamiltonian cycle
- graph structure
- dynamic programming
- minimum cost
- graph connectivity
- edge weights
- directed graph
- attributed graphs
- approximation algorithms
- maximum matching
- spanning tree
- matching algorithm
- graph model
- boundary points
- connected components
- strongly connected
- minimum length
- polynomial time complexity
- worst case
- np hard
- computational complexity
- learning algorithm
- maximum cardinality
- approximation ratio
- random graphs
- directed acyclic graph
- error bounds
- expectation maximization
- input data
- k means
- objective function
- graph search
- minimum weight
- bipartite graph
- closed form
- segmentation algorithm
- error tolerance
- adjacency graph
- probabilistic model