The steiner problem in graphs
From MaRDI portal
Publication:5636923
DOI10.1002/net.3230010302zbMath0229.05125MaRDI QIDQ5636923
Stuart E. Dreyfus, Robert A. Wagner
Publication date: 1972
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230010302
05C99: Graph theory
Related Items
A probably fast, provably optimal algorithm for rectilinear Steiner trees, The computation of nearly minimal Steiner trees in graphs, Strongly polynomial algorithm for two special minimum concave cost network flow problems, A branch-and-price algorithm for switch-box routing, Cost-minimal trees in directed acyclic graphs, On the Hardness of Reoptimization, Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets, A branch-and-price algorithm for the Steiner tree packing problem., Heuristic algorithms for packing of multiple-group multicasting, Minimum-weight two-connected spanning networks, On the point-to-point connection problem, A factoring approach for the Steiner tree problem in undirected networks, A survey of dynamic network flows, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, Steiner problem in Halin networks, Proving phylogenetic trees minimal with l-clustering and set partitioning, Polynomially solvable special cases of the Steiner problem in planar networks, The role of Steiner hulls in the solution to Steiner tree problems, Two new criteria for finding Steiner hulls in Steiner tree problems, Path-distance heuristic for the Steiner problem in undirected networks, The point-to-point delivery and connection problems: Complexity and algorithms, Steiner trees with \(n\) terminals among \(n+1\) nodes, Heuristics for the Steiner problem in graphs, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Minimal connected enclosures on an embedded planar graph, Neural and delay based heuristics for the Steiner problem in networks, Tree polytope on 2-trees, A primal-dual approximation algorithm for the Steiner forest problem, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, The point-to-point connection problem - analysis and algorithms, The dynamic predicate stashing copy problem and the Steiner problem in graphs, Two variations of the minimum Steiner problem, Steiner's problem in double trees, The Turing way to parameterized complexity, The propagation of updates to relational tables in a distributed database system, Packing Steiner trees: A cutting plane algorithm and computational results, The number of tree stars is \(O^{*}(1.357^k)\), Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees, A dual ascent approach for steiner tree problems on a directed graph, Using structured steiner trees for hierarchical global routing, The number of tree stars is O*(1.357k), Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems, Reoptimization of Steiner Trees, Fuzzy Replacement Analysis, Faster Steiner Tree Computation in Polynomial-Space, Unnamed Item, On finding steiner vertices
Cites Work
