Pages that link to "Item:Q3297834"
From MaRDI portal
The following pages link to An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834):
Displaying 12 items.
- On efficient implementation of an approximation algorithm for the Steiner tree problem (Q911286) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- An improved LP-based approximation for Steiner tree (Q2875185) (← links)
- The Power of Dynamic Distance Oracles (Q2941483) (← links)
- (Q3519877) (← links)
- (Q4038157) (← links)
- Efficient path and vertex exchange in steiner tree algorithms (Q4367276) (← links)
- (Q4525729) (← links)
- (Q5400240) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)