Augmenting Euclidean Networks—the Steiner Case

DOI10.1137/0145051zbMATH Open0584.94029OpenAlexW2080581853MaRDI QIDQ3710474FDOQ3710474

Authors: Dan Trietsch 

Publication date: 1985

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0145051

Recommendations

• Interconnecting networks in the plane: The steiner case
• On shortest two-connected Steiner networks with Euclidean distance
• Determining shortest networks in the Euclidean plane
• Euclidean Steiner minimum trees: An improved exact algorithm
• On shortest three-edge-connected Steiner networks with Euclidean distance

zbMATH Keywords

network designSteiner tree

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Cited In (10)

• A flow-dependent quadratic Steiner tree problem in the Euclidean plane
• Maximising the worth of nascent networks
• Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
• Minimum cost flow‐dependent communication networks
• On the solution of the generalized steiner problem by the subgradient method
• Title not available (Why is that?)
• Flow-dependent networks: Existence and behavior at Steiner points
• Cost-minimizing networks among immiscible fluids in \({\mathbb{R}}^2\)
• Interconnecting networks in the plane: The steiner case
• A direct solution of allocation problems

This page was built for publication: Augmenting Euclidean Networks—the Steiner Case

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