The following pages link to (Q5654074):
Displaying 9 items.
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
