Constructing minimal spanning/Steiner trees with bounded path length

DOI10.1016/S0167-9260(97)00009-6zbMATH Open0894.68065WikidataQ127740426 ScholiaQ127740426MaRDI QIDQ4397100FDOQ4397100

Authors: Jaewon Oh, Iksoo Pyo, Massoud Pedram 

Publication date: 30 June 1998

Published in: Integration (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 437549
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
• scientific article; zbMATH DE number 3918122
• Steiner tree problem with minimum number of Steiner points and bounded edge-length

zbMATH Keywords

Steiner treeminimal spanning treebounded path length minimal spanning treekruskal

Mathematics Subject Classification ID

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

Cited In (4)

• Minimizing the sum of distances to a server in a constraint network
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• Minimal spanning trees and Stein's method
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

This page was built for publication: Constructing minimal spanning/Steiner trees with bounded path length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397100)