Fixed topology Steiner trees and spanning forests

DOI10.1016/S0304-3975(98)00216-3zbMath0913.68151OpenAlexW1973297904MaRDI QIDQ1285596

Lusheng Wang, Xiao-Hua Jia

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00216-3

zbMATH Keywords

time-delaybandwidth constraintsspanning forestsfixed topology Steiner trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Minimum diameter cost-constrained Steiner trees

Cites Work

• A linear time algorithm for full Steiner trees
• On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
• Locating the vertices of a steiner tree in an arbitrary metric space
• On Steiner Minimal Trees with Rectilinear Distance
• Steiner tree problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed topology Steiner trees and spanning forests