Login / Signup
On the approximability of the Steiner tree problem.
Martin Thimm
Published in:
Theor. Comput. Sci. (2003)
Keyphrases
</>
prize collecting
approximation algorithms
multicast routing
steiner tree
delay constrained
web services
three dimensional
high quality
multiscale
lower bound
special case
np hard
wireless sensor networks
scheduling problem
worst case
response time