Pages that link to "Item:Q5375342"
From MaRDI portal
The following pages link to Bottleneck Steiner trees in the plane (Q5375342):
Displaying 14 items.
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)
