The following pages link to The full Steiner tree problem (Q702772):
Displaying 19 items.
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- On the terminal connection problem (Q831820) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- On full Steiner trees in unit disk graphs (Q2349739) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Algorithms for terminal Steiner trees (Q2465633) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- The minimum evolution problem: Overview and classification (Q5191134) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
