Pages that link to "Item:Q3082919"
From MaRDI portal
The following pages link to On the Full and Bottleneck Full Steiner Tree Problems (Q3082919):
Displaying 12 items.
- On some network design problems with degree constraints (Q355516) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← 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)
- 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)