On finding steiner vertices

DOI10.1002/net.3230160305zbMath0644.90095OpenAlexW2115036101MaRDI QIDQ3787814

No author found.

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230160305

zbMATH Keywords

heuristic algorithmsminimum spanning treeSteiner treesubgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

Worst-case performance of Rayward-Smith's Steiner tree heuristic, Fast heuristic algorithms for rectilinear Steiner trees, A heuristic for the Steiner problem in graphs, A factoring approach for the Steiner tree problem in undirected networks, The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs, Minimum cost multicast routing using ant colony optimization algorithm, Branch-and-bound as a higher-order function, Path-distance heuristic for the Steiner problem in undirected networks, Heuristics for the Steiner problem in graphs, Steiner's problem in graphs: Heuristic methods, Mathematical methods for physical layout of printed circuit boards: an overview, Heuristic algorithms for packing of multiple-group multicasting, Looking ahead with the pilot method, Non delayed relax-and-cut algorithms

Cites Work

• A note on two problems in connexion with graphs
• The steiner problem in graphs