scientific article; zbMATH DE number 3384060
From MaRDI portal
Publication:5654074
zbMATH Open0243.05119MaRDI QIDQ5654074FDOQ5654074
Publication date: 1971
Title of this publication is not available (Why is that?)
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)
- Steiner 4-diameter, maximum degree and size of a graph
- Bounds on the Steiner–Wiener index of graphs
- Fast heuristic algorithms for rectilinear Steiner trees
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
- Faster algorithm for optimum Steiner trees
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- A heuristic for the Steiner problem in graphs
- A factoring approach for the Steiner tree problem in undirected networks
- On Directed Steiner Trees with Multiple Roots
- The enumeration of minimal phylograms
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Approximation Limitations of Pure Dynamic Programming
- Steiner distance and convexity in graphs
- Polynomially solvable special cases of the Steiner problem in planar networks
- Sorting can exponentially speed up pure dynamic programming
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- Heuristic algorithms for packing of multiple-group multicasting
- Greedy can beat pure dynamic programming
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)
