Pages that link to "Item:Q1583698"
From MaRDI portal
The following pages link to On the complexity of the Steiner problem (Q1583698):
Displaying 6 items.
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)
- Solving the prize‐collecting Euclidean Steiner tree problem (Q6071078) (← links)
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane (Q6167087) (← links)
