Parallelized approximation algorithms for minimum routing cost spanning trees
Ching-Lueh ChangYuh-Dauh LyuuPublished in: CoRR (2007)
Keyphrases
- minimum cost
- spanning tree
- approximation algorithms
- edge disjoint
- np hard
- minimum spanning tree
- vertex cover
- special case
- worst case
- network flow
- approximation ratio
- undirected graph
- set cover
- constant factor
- minimum weight
- facility location problem
- minimum spanning trees
- network design problem
- primal dual
- open shop
- precedence constraints
- minimum total cost
- approximation schemes
- randomized algorithms
- computational complexity
- edge weights
- scheduling problem
- lower bound
- optimal solution
- routing problem
- graphical models