Login / Signup
Approximation algorithms for spanner problems and Directed Steiner Forest.
Piotr Berman
Arnab Bhattacharyya
Konstantin Makarychev
Sofya Raskhodnikova
Grigory Yaroslavtsev
Published in:
Inf. Comput. (2013)
Keyphrases
</>
approximation algorithms
vertex cover
np hard
randomized algorithms
exact algorithms
np hardness
special case
approximation schemes
open shop
approximation ratio
network design problem
facility location problem
np complete
disjoint paths
set cover
lower bound
precedence constraints
minimum cost
worst case