Pages that link to "Item:Q4020358"
From MaRDI portal
The following pages link to The shortest network under a given topology (Q4020358):
Displaying 20 items.
- On the existence of shortest networks in Banach spaces (Q382352) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- Steiner minimal trees for a class of zigzag lines (Q1186798) (← links)
- An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology (Q1283683) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- Variational approach and Steiner minimal trees on four points (Q1336673) (← links)
- Steiner polygons in the Steiner problem (Q1337104) (← links)
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Existence of shortest directed networks in \(\mathbb{R}^ 2\) (Q1893293) (← links)
- Shortest shortest path trees of a network (Q1917275) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- Computing the degree-4 shortest network under a given topology (Q1972318) (← links)
- Shortest directed networks in the plane (Q2227985) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- An algorithm for finding 4-degree Steiner trees with a special topology (Q2706668) (← links)
- (Q4400643) (← links)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← links)
