We present pseudo-polynomial time algorithms for fixed topology Steiner tre
e problems with various time-delay constraints. We study the spanning fores
t problem with bandwidth constraint. A polynomial-time algorithm is given.
Those problems have applications in network communications. (C) 1999 Publis
hed by Elsevier Science B.V. All rights reserved.