Citation
Ls. Wang et Xh. Jia, Fixed topology Steiner trees and spanning forests, THEOR COMP, 215(1-2), 1999, pp. 359-370
Citations number
10
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975
→ ACNP
Volume
215
Issue
1-2
Year of publication
1999
Pages
359 - 370
Database
ISI
SICI code
0304-3975(19990228)215:1-2<359:FTSTAS>2.0.ZU;2-3
Abstract
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.