An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.
Alessandro FerranteMimmo ParentePublished in: ICTCS (2003)
Keyphrases
- minimum weight
- maximum cardinality
- spanning tree
- minimum spanning tree
- greedy heuristic
- triangle inequality
- bipartite graph
- np hard
- randomized algorithm
- undirected graph
- similarity search
- learning algorithm
- weighted graph
- dynamic programming
- optimal solution
- tree structure
- approximation algorithms
- graph structure
- worst case
- nearest neighbor
- edge weights
- quadratic assignment problem
- greedy algorithm
- segmentation algorithm
- evolutionary algorithm
- search space
- computational complexity
- objective function
- database