Login / Signup
Faster approximation algorithms for the minimum latency problem.
Aaron Archer
David P. Williamson
Published in:
SODA (2003)
Keyphrases
</>
approximation algorithms
minimum cost
constant factor
np hard
special case
vertex cover
worst case
np hardness
primal dual
network design problem
set cover
facility location problem
exact algorithms
network flow
spanning tree
open shop
disjoint paths
approximation ratio
randomized algorithms
approximation schemes