scientific article; zbMATH DE number 3384060

MaRDI QIDQ5654074zbMATHzbMATHFDO

Authors A. Ju. Levin

Publication date 1971

Mathematics Subject Classification ID

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)

Cited in

(20)

• Faster algorithm for optimum Steiner trees
• Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
• Bounds on the Steiner-Wiener index of graphs
• Heuristic algorithms for packing of multiple-group multicasting
• Sorting can exponentially speed up pure dynamic programming
• Steiner 4-diameter, maximum degree and size of a graph
• A factoring approach for the Steiner tree problem in undirected networks
• Steiner distance and convexity in graphs
• Approximation limitations of pure dynamic programming
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals
• A heuristic for the Steiner problem in graphs
• Greedy can beat pure dynamic programming
• A probably fast, provably optimal algorithm for rectilinear Steiner trees
• Polynomially solvable special cases of the Steiner problem in planar networks
• Fast heuristic algorithms for rectilinear Steiner trees
• Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
• The enumeration of minimal phylograms
• On directed Steiner trees with multiple roots
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Extending the kernel for planar Steiner tree to the number of Steiner vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654074)