The following pages link to (Q5654074):
Displaying 20 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)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- The enumeration of minimal phylograms (Q2264631) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- Steiner 4-diameter, maximum degree and size of a graph (Q5087601) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Bounds on the Steiner–Wiener index of graphs (Q5101912) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
