Steiner's problem in graphs and its implications
From MaRDI portal
Publication:5636922
DOI10.1002/net.3230010203zbMath0229.05124OpenAlexW2132087752WikidataQ61248966 ScholiaQ61248966MaRDI QIDQ5636922
Publication date: 1971
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230010203
Related Items
A primal-dual approximation algorithm for the Steiner forest problem, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube, An exact algorithm for constructing minimum Euclidean skeletons of polygons, Steiner problem in Halin networks, On Directed Steiner Trees with Multiple Roots, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, The propagation of updates to relational tables in a distributed database system, Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy, An edge elimination test for the Steiner problem in graphs, The point-to-point connection problem - analysis and algorithms, A heuristic for the Steiner problem in graphs, Steiner 4-diameter, maximum degree and size of a graph, A Note on the Steinerk-Diameter of Tensor Product Networks, Extending the kernel for planar Steiner tree to the number of Steiner vertices, A factoring approach for the Steiner tree problem in undirected networks, On the approximability of dense Steiner problems, Bounds on the Steiner–Wiener index of graphs, An exact branch and bound algorithm for the Steiner Problem in Graphs, Solving Steiner trees: Recent advances, challenges, and perspectives, Proving phylogenetic trees minimal with l-clustering and set partitioning, Steiner distance and convexity in graphs, Steiner problems on directed acyclic graphs, Swap-vertex based neighborhood for Steiner tree problems, A generalization of the Graham-Pollak tree theorem to Steiner distance, Unnamed Item, Combination algorithms for Steiner tree variants, On locating new facilities in a competitive environment, Connectivity calculus, The role of Steiner hulls in the solution to Steiner tree problems, A Lagrangean-based decomposition approach for the link constrained Steiner tree problem, Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing, Two new criteria for finding Steiner hulls in Steiner tree problems, Path-distance heuristic for the Steiner problem in undirected networks, A dual ascent approach for steiner tree problems on a directed graph, Algorithmic aspects of Steiner convexity and enumeration of Steiner trees, Cost-minimal trees in directed acyclic graphs, Two variations of the minimum Steiner problem, Using structured steiner trees for hierarchical global routing, An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions, Heuristic algorithms for packing of multiple-group multicasting, The vertex steiner number of a graph, Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions), A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Minimal connected enclosures on an embedded planar graph, The dynamic predicate stashing copy problem and the Steiner problem in graphs, Neural and delay based heuristics for the Steiner problem in networks, Steiner's problem in double trees, Generalized Steiner problem in outerplanar networks
Cites Work
