The following pages link to Computing and Combinatorics (Q5716954):
Displaying 10 items.
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- A note on the terminal Steiner tree problem (Q1014425) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- Algorithms for terminal Steiner trees (Q2465633) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Steiner Trees for Terminals Constrained to Curves (Q3128200) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)