Approximation of minimum weight spanners for sparse graphs.
Feodor F. DraganFedor V. FominPetr A. GolovachPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- minimum weight
- spanning tree
- weighted graph
- bipartite graph
- maximum cardinality
- minimum spanning tree
- randomized algorithm
- planar graphs
- edge weights
- greedy heuristic
- high dimensional
- minimum cost
- image segmentation
- sparse representation
- graph structure
- lower bound
- approximation algorithms
- undirected graph
- directed graph
- shortest path
- special case
- multi class
- greedy algorithm
- markov chain
- supervised learning