Shortest directed networks in the plane

DOI10.1007/s00373-020-02183-8zbMath1458.05093arXiv1903.07172OpenAlexW3034301632MaRDI QIDQ2227985

Alastair Maxwell, Konrad J. Swanepoel

Publication date: 16 February 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

normed planestraightedge and compassEuclidean Steiner problemshortest directed network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Optimization of shapes other than minimal surfaces (49Q10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane

Cites Work

• Unnamed Item
• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• On the history of the Euclidean Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• On the existence of shortest directed networks
• The local Steiner problem in normed planes
• Steiner Minimal Trees

This page was built for publication: Shortest directed networks in the plane