Steiner's problem in graphs and its implications
From MaRDI portal
Publication:5636922
DOI10.1002/net.3230010203zbMath0229.05124WikidataQ61248966 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
05C99: Graph theory
Related Items
Cost-minimal trees in directed acyclic graphs, Heuristic algorithms for packing of multiple-group multicasting, A factoring approach for the Steiner tree problem in undirected networks, Generalized Steiner problem in outerplanar networks, Steiner problem in Halin networks, An edge elimination test for the Steiner problem in graphs, Proving phylogenetic trees minimal with l-clustering and set partitioning, On locating new facilities in a competitive environment, 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, 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, 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, The point-to-point connection problem - analysis and algorithms, Connectivity calculus, 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 propagation of updates to relational tables in a distributed database system, A heuristic for the Steiner problem in graphs, Steiner distance and convexity in graphs, Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing, A dual ascent approach for steiner tree problems on a directed graph, Using structured steiner trees for hierarchical global routing, Unnamed Item
Cites Work
