Pages that link to "Item:Q5902589"
From MaRDI portal
The following pages link to An algorithm for the steiner problem in graphs (Q5902589):
Displayed 10 items.
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Efficiency considerations in the implementation of parallel branch-and- bound (Q1309863) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)