scientific article; zbMATH DE number 3384060

MaRDI QIDQ5654074zbMATH OpenFDO

Authors A. Ju. Levin

Publication date 1971

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35)

Cited in

(22)

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

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)