Pages that link to "Item:Q911286"
From MaRDI portal
The following pages link to On efficient implementation of an approximation algorithm for the Steiner tree problem (Q911286):
Displaying 7 items.
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- An 11/6-approximation algorithm for the network Steiner problem (Q2366230) (← links)
- A faster implementation of the Goemans-Williamson clustering algorithm (Q2768267) (← links)
- The Power of Dynamic Distance Oracles (Q2941483) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- (Q3519877) (← links)