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

Lusheng Wang; Xiaohua Jia

doi:10.1007/bfb0045104

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

Lusheng Wang^*
, Xiaohua Jia

^*Corresponding author for this work

Department of Computer Science

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

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. © Springer-Verlag Berlin Heidelberg 1997

Original language	English
Title of host publication	Computing and Combinatorics
Subtitle of host publication	Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.
Editors	Tao Jiang, D. T. Lee
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	373-382
ISBN (Electronic)	978-3-540-69522-6
ISBN (Print)	9783540633570
DOIs	https://doi.org/10.1007/bfb0045104
Publication status	Published - 1997
Event	3rd Annual International Computing and Combinatorics Conference (COCOON 1997) - Shanghai, China Duration: 20 Aug 1997 → 22 Aug 1997

Publication series

Name	Lecture Notes in Computer Science
Volume	1276
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd Annual International Computing and Combinatorics Conference (COCOON 1997)
Place	China
City	Shanghai
Period	20/08/97 → 22/08/97

Access Output

10.1007/bfb0045104

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Wang, L., & Jia, X. (1997). Fixed topology steiner trees and spanning forests with applications in network communications. In T. Jiang, & D. T. Lee (Eds.), Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings. (pp. 373-382). (Lecture Notes in Computer Science ; Vol. 1276). Springer . https://doi.org/10.1007/bfb0045104

Wang, Lusheng ; Jia, Xiaohua. / Fixed topology steiner trees and spanning forests with applications in network communications. Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.. editor / Tao Jiang ; D. T. Lee. Berlin, Heidelberg : Springer , 1997. pp. 373-382 (Lecture Notes in Computer Science ).

@inproceedings{0096ee857ea34125a0c841bfb04edaa5,

title = "Fixed topology steiner trees and spanning forests with applications in network communications",

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 1997",

author = "Lusheng Wang and Xiaohua Jia",

year = "1997",

doi = "10.1007/bfb0045104",

language = "English",

isbn = "9783540633570",

series = "Lecture Notes in Computer Science ",

publisher = "Springer ",

pages = "373--382",

editor = "Tao Jiang and Lee, \{D. T.\}",

booktitle = "Computing and Combinatorics",

note = "3rd Annual International Computing and Combinatorics Conference (COCOON 1997) ; Conference date: 20-08-1997 Through 22-08-1997",

}

Wang, L & Jia, X 1997, Fixed topology steiner trees and spanning forests with applications in network communications. in T Jiang & DT Lee (eds), Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.. Lecture Notes in Computer Science , vol. 1276, Springer , Berlin, Heidelberg, pp. 373-382, 3rd Annual International Computing and Combinatorics Conference (COCOON 1997), Shanghai, China, 20/08/97. https://doi.org/10.1007/bfb0045104

Fixed topology steiner trees and spanning forests with applications in network communications. / Wang, Lusheng ; Jia, Xiaohua.
Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.. ed. / Tao Jiang; D. T. Lee. Berlin, Heidelberg: Springer , 1997. p. 373-382 (Lecture Notes in Computer Science ; Vol. 1276).

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

TY - GEN

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

AU - Wang, Lusheng

AU - Jia, Xiaohua

PY - 1997

Y1 - 1997

N2 - 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. © Springer-Verlag Berlin Heidelberg 1997

AB - 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. © Springer-Verlag Berlin Heidelberg 1997

UR - https://www.scopus.com/pages/publications/84947772425

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84947772425&origin=recordpage

U2 - 10.1007/bfb0045104

DO - 10.1007/bfb0045104

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9783540633570

T3 - Lecture Notes in Computer Science

SP - 373

EP - 382

BT - Computing and Combinatorics

A2 - Jiang, Tao

A2 - Lee, D. T.

PB - Springer

CY - Berlin, Heidelberg

T2 - 3rd Annual International Computing and Combinatorics Conference (COCOON 1997)

Y2 - 20 August 1997 through 22 August 1997

ER -

Wang L , Jia X. Fixed topology steiner trees and spanning forests with applications in network communications. In Jiang T, Lee DT, editors, Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings.. Berlin, Heidelberg: Springer . 1997. p. 373-382. (Lecture Notes in Computer Science ). doi: 10.1007/bfb0045104

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

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this