Fixed topology Steiner trees and spanning forests

Lusheng Wang; Xiaohua Jia

doi:10.1016/s0304-3975(98)00216-3

Fixed topology Steiner trees and spanning forests

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review

Overview

7 Scopus Citations

Scopus Metrics

View graph of relations

Author(s)

Related Research Unit(s)

Department of Computer Science

Detail(s)

Original language	English
Pages (from-to)	359-370
Journal / Publication	Theoretical Computer Science
Volume	215
Issue number	1-2
Publication status	Published - 28 Feb 1999

Link(s)

DOI	DOI https://doi.org/10.1016/s0304-3975(98)00216-3 Final Published version
	Check@CityULib
Link to Scopus	https://www.scopus.com/record/display.uri?eid=2-s2.0-0347028371&origin=recordpage
Permanent Link	https://scholars.cityu.edu.hk/en/publications/publication(62923986-f499-4590-9fa6-765edf0d2eae).html

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. © 1999 Published by Elsevier Science B.V. All rights reserved.