On finding steiner vertices

DOI10.1002/NET.3230160305MaRDI QIDQ3787814zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• scientific article; zbMATH DE number 3871417
• A faster approximation algorithm for the Steiner problem in graphs
• scientific article; zbMATH DE number 26676
• A heuristic for Euclidean and rectilinear Steiner problems
• scientific article; zbMATH DE number 3918122

Cites work

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

Cited in

(15)

• Worst-case performance of Rayward-Smith's Steiner tree heuristic
• Fast heuristic algorithms for rectilinear Steiner trees
• 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
• A heuristic for the Steiner problem in graphs
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• scientific article; zbMATH DE number 26676 (Why is no real title available?)
• Minimum cost multicast routing using ant colony optimization algorithm
• Heuristic algorithms for packing of multiple-group multicasting
• Looking ahead with the pilot method
• Non delayed relax-and-cut algorithms
• A factoring approach for the Steiner tree problem in undirected networks
• Mathematical methods for physical layout of printed circuit boards: an overview

This page was built for publication: On finding steiner vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787814)