Approximation Algorithms for Quickest Spanning Tree Problems.
Refael HassinAsaf LevinPublished in: Algorithmica (2005)
Keyphrases
- approximation algorithms
- minimum cost
- spanning tree
- vertex cover
- np hard
- np hardness
- randomized algorithms
- exact algorithms
- minimum spanning tree
- approximation schemes
- worst case
- special case
- network design problem
- undirected graph
- approximation ratio
- open shop
- set cover
- ant colony optimization
- minimum spanning trees