Pages that link to "Item:Q346528"
From MaRDI portal
The following pages link to A practical greedy approximation for the directed Steiner tree problem (Q346528):
Displaying 4 items.
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Navigational guidance -- a deep learning approach (Q6113464) (← links)
