scientific article; zbMATH DE number 3384060
From MaRDI portal
Publication:5654074
zbMath0243.05119MaRDI QIDQ5654074
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (20)
Greedy can beat pure dynamic programming ⋮ On Directed Steiner Trees with Multiple Roots ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ A heuristic for the Steiner problem in graphs ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ Extending the kernel for planar Steiner tree to the number of Steiner vertices ⋮ A factoring approach for the Steiner tree problem in undirected networks ⋮ A probably fast, provably optimal algorithm for rectilinear Steiner trees ⋮ Bounds on the Steiner–Wiener index of graphs ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Steiner distance and convexity in graphs ⋮ Faster algorithm for optimum Steiner trees ⋮ Polynomially solvable special cases of the Steiner problem in planar networks ⋮ Algorithmic aspects of Steiner convexity and enumeration of Steiner trees ⋮ The enumeration of minimal phylograms ⋮ Heuristic algorithms for packing of multiple-group multicasting ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Complexity of the Steiner Network Problem with Respect to the Number of Terminals ⋮ Sorting can exponentially speed up pure dynamic programming
This page was built for publication:
