Approximation Algorithms for Quickest Spanning Tree Problems.

Refael Hassin Asaf Levin

Published in: ESA (2004)

Keyphrases

approximation algorithms
minimum cost
spanning tree
vertex cover
exact algorithms
np hardness
special case
np hard
undirected graph
network design problem
randomized algorithms
constant factor
primal dual
open shop
optimal solution
approximation schemes
minimum weight
traveling salesman problem
search algorithm