The Gilbert arborescence problem

DOI10.1002/net.21475zbMath1269.90026arXiv0909.4270OpenAlexW3101920128WikidataQ61714613 ScholiaQ61714613MaRDI QIDQ5326792

M. G. Volz, Konrad J. Swanepoel, Marcus Brazil, Doreen Anne Thomas, Charl J. Ras

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.4270

zbMATH Keywords

network flowsSteiner treeminimum-cost networkGilbert network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Cites Work

• The local Steiner problem in finite-dimensional normed spaces
• The Steiner tree problem
• Vertex degrees of Steiner minimal trees in \(\ell_p^d\) and other smooth Minkowski spaces
• Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
• Optimal Design of Gas Pipeline Networks
• Low cost drainage networks
• Pseudo-Gilbert-Steiner trees
• Flow-dependent networks: Existence and behavior at Steiner points
• Minimum cost flow‐dependent communication networks

This page was built for publication: The Gilbert arborescence problem