Pages that link to "Item:Q1029037"
From MaRDI portal
The following pages link to On approximation algorithms for the terminal Steiner tree problem (Q1029037):
Displaying 15 items.
- On some network design problems with degree constraints (Q355516) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- The minimum spanning tree problem with non-terminal set (Q456089) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← 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)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Algorithms for terminal Steiner trees (Q2465633) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- DIAMETER-CONSTRAINED STEINER TREES (Q2905280) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
