Saving an epsilon: a 2-approximation for the k-MST problem in graphs.
Naveen GargPublished in: STOC (2005)
Keyphrases
- minimum spanning tree
- spanning tree
- graph theoretic
- minimal spanning tree
- edge weights
- approximation algorithms
- graph theory
- queueing networks
- closed form
- graph mining
- graph representation
- directed graph
- graph matching
- error bounds
- weighted graph
- graph structure
- computational complexity
- approximation methods
- graph structures
- approximation schemes
- max cut
- data sets