Fixed topology steiner trees and spanning forests with applications in network communications

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

View graph of relations

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationComputing and Combinatorics
Subtitle of host publication3rd Annual International Conference COCOON 1997, Proceedings
EditorsTao Jiang, D.T. Lee
PublisherSpringer Verlag
Pages373-382
Volume1276
ISBN (print)354063357, 9783540633570
Publication statusPublished - 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1276
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Conference

Title3rd Annual International Computing and Combinatorics Conference, COCOON 1997
PlaceChina
CityShanghai
Period20 - 22 August 1997

Abstract

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.

Citation Format(s)

Fixed topology steiner trees and spanning forests with applications in network communications. / Wang, Lusheng; Jia, Xiaohua.
Computing and Combinatorics: 3rd Annual International Conference COCOON 1997, Proceedings. ed. / Tao Jiang; D.T. Lee. Vol. 1276 Springer Verlag, 1997. p. 373-382 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1276).

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review