The shortest network under a given topology
From MaRDI portal
Publication:4020358
DOI10.1016/0196-6774(92)90050-MzbMath0764.68119OpenAlexW1988466537MaRDI QIDQ4020358
No author found.
Publication date: 16 January 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(92)90050-m
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
Variational approach and Steiner minimal trees on four points ⋮ Steiner polygons in the Steiner problem ⋮ Existence of shortest directed networks in \(\mathbb{R}^ 2\) ⋮ A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ ⋮ Shortest shortest path trees of a network ⋮ Approximation algorithms for tree alignment with a given phylogeny ⋮ O(n log n)-average-time algorithm for shortest network under a given topology ⋮ A primer of the Euclidean Steiner problem ⋮ Steiner minimal trees for a class of zigzag lines ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ An entropy regularization technique for minimizing a sum of Tchebycheff norms ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
This page was built for publication: The shortest network under a given topology
