Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.
Yen Hung ChenBang Ye WuChuan Yi TangPublished in: ICCSA (3) (2004)
Keyphrases
- approximation algorithms
- minimum cost
- spanning tree
- vertex cover
- np hard
- special case
- approximation schemes
- np hardness
- randomized algorithms
- undirected graph
- minimum spanning tree
- minimum weight
- worst case
- constant factor
- precedence constraints
- network design problem
- bayesian networks
- total cost
- approximation ratio
- weighted graph
- linear programming
- disjoint paths