Pages that link to "Item:Q1571033"
From MaRDI portal
The following pages link to A constrained minimum spanning tree problem (Q1571033):
Displaying 8 items.
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)
