Login / Signup
On the Approximability of the Steiner Tree Problem.
Martin Thimm
Published in:
MFCS (2001)
Keyphrases
</>
prize collecting
multicast routing
approximation algorithms
steiner tree
special case
multiscale
lower bound
network structure
polynomial time approximation