Existence of shortest directed networks in R^ 2
From MaRDI portal
Publication:1893293
This paper establishes the existence of a shortest directed network in \(\mathbb{R}^ 2\) connecting all of a given set of starting points to all of a given set of ending points. In such networks, up to six segments sometimes meet at a point. The main difficulty is bounding the number of nodes, since shortest directed networks may contain cycles. It is an open question whether existence holds in \(\mathbb{R}^ n\).
Recommendations
- On the existence of shortest directed networks
- On the existence of shortest networks in Banach spaces
- Shortest directed networks in the plane
- scientific article; zbMATH DE number 5052313
- Determining shortest networks in the Euclidean plane
- The shortest network under a given topology
- scientific article; zbMATH DE number 1559433
- Shortest paths in simply connected regions in \({\mathbb{R}}^ 2\)
- scientific article; zbMATH DE number 1163728
- scientific article; zbMATH DE number 176576
Cited in
(5)- Shortest directed networks in the plane
- On the existence of shortest networks in Banach spaces
- On the existence of shortest directed networks
- Optimal connection problem of single source multiple sinks on directed networks
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
This page was built for publication: Existence of shortest directed networks in \(\mathbb{R}^ 2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893293)
