Cut and patch Steiner trees for ladders
type: Item
instance of: scholarly article
title: Cut and patch Steiner trees for ladders
zbMATH Open document ID: 0874.05019
DOI: 10.1016/0012-365X(95)00275-2
author: Rainer E. Burkard
author: Tibor Dudás
author: Thomas Maier
published in: Discrete Mathematics
publication date: 1997-06-09T00:00:00Z
review text: The authors show how to construct the Steiner minimum tree for a ladder by the cut and patch method. They prove that all intersection points between the Steiner tree and the ladder lie on two straight lines.
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1018472
zbMATH Keywords: ladder
zbMATH Keywords: Steiner tree
reviewed by: Du Ding-Zhu
MaRDI profile type: Publication
cites work: Steiner Trees on a Checkerboard
cites work: Steiner Trees for Ladders
cites work: Steiner minimal trees for bar waves
cites work: Steiner Minimal Tree for Points on a Circle
cites work: Steiner minimal trees on sets of four points
cites work: Steiner Minimal Trees on Zig-Zag Lines
cites work: Steiner minimal trees for regular polygons
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: A primer of the Euclidean Steiner problem
cites work: Steiner Minimal Trees on Chinese Checkerboards
cites work: Steiner tree problems
cites work: The Steiner tree problem
cites work: On the Problem of Steiner
description: scientific article; zbMATH DE number 1018472