Shortest directed networks in the plane

DOI10.1007/S00373-020-02183-8MaRDI QIDQ2227985zbMATH OpenOpenAlexFDO

Authors Alastair Maxwell, Konrad J. Swanepoel

Publication date 16 February 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

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

Abstract: Given a set of sources and a set of sinks as points in the Euclidean plane, a directed network is a directed graph drawn in the plane with a directed path from each source to each sink. Such a network may contain nodes other than the given sources and sinks, called Steiner points. We characterize the local structure of the Steiner points in all shortest-length directed networks in the Euclidean plane. This characterization implies that these networks are constructible by straightedge and compass. Our results build on unpublished work of Alfaro, Campbell, Sher, and Soto from 1989 and 1990. Part of the proof is based on a new method that uses other norms in the plane. This approach gives more conceptual proofs of some of their results, and as a consequence, we also obtain results on shortest directed networks for these norms.

Recommendations

• On the existence of shortest directed networks
• Determining shortest networks in the Euclidean plane
• scientific article; zbMATH DE number 5052313
• The shortest network under a given topology
• scientific article; zbMATH DE number 1559433
• scientific article; zbMATH DE number 176576
• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• scientific article; zbMATH DE number 60387
• scientific article; zbMATH DE number 1163728

Cites work

• scientific article; zbMATH DE number 3781091 (Why is no real title available?)
• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• On the existence of shortest directed networks
• On the history of the Euclidean Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Steiner Minimal Trees
• The local Steiner problem in normed planes

Cited in

(4)

• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• Locally minimal uniformly oriented shortest networks
• Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
• On the existence of shortest directed networks

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

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