Approximation algorithms for some optimum communication spanning tree problems.
Bang Ye WuKun-Mao ChaoChuan Yi TangPublished in: Discret. Appl. Math. (2000)
Keyphrases
- approximation algorithms
- minimum cost
- spanning tree
- vertex cover
- network design problem
- np hard
- special case
- worst case
- undirected graph
- np hardness
- exact algorithms
- randomized algorithms
- constant factor approximation
- approximation schemes
- network flow
- optimization problems
- minimum spanning tree
- primal dual
- constant factor
- convex optimization
- open shop
- upper bound