Interconnecting networks in the plane: The steiner case

DOI10.1002/NET.3230200109MaRDI QIDQ4735009zbMATH OpenOpenAlexFDO

Authors Dan Trietsch

Publication date 1990

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230200109

zbMATH Keywords

Steiner pointsplanar networksflow- dependent costslinks of minimal total length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)

Recommendations

• Augmenting Euclidean Networks—the Steiner Case
• An analogue of Morse theory for planar linear networks and the generalized Steiner problem
• The Steiner tree problem
• Interconnecting Highways
• A.D. Alexandrov spaces with curvature bounded below

Cites work

• On the Problem of Steiner

Cited in

(10)

• An initial study of budgeted Steiner networks
• Augmenting Euclidean Networks—the Steiner Case
• Construction of the current Steiner network of the second optimality rank
• Projective planes and congestion-free networks
• Pseudo-Gilbert-Steiner trees
• How Many Steiner Terminals Can You Connect in 20 Years?
• Flow-dependent networks: Existence and behavior at Steiner points
• Cost-minimizing networks among immiscible fluids in \({\mathbb{R}}^2\)
• scientific article; zbMATH DE number 1743829 (Why is no real title available?)
• A direct solution of allocation problems

This page was built for publication: Interconnecting networks in the plane: The steiner case

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