𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fixed topology Steiner trees and spanning forests

✍ Scribed by Wang Lusheng; Xiaohua Jia

Book ID
104326585
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
731 KB
Volume
215
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algorithm is given. Those problems have applications in network communications.

πŸ“œ SIMILAR VOLUMES

Uniform and minimal essential spanning f
Uniform and minimal essential spanning forests on trees
✍ Olle HΓ€ggstrΓΆm πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,