A note on A faster approximation algorithm for the Steiner problem in graphs

DOI10.1016/0020-0190(91)90096-ZMaRDI QIDQ1178221zbMATH OpenFDO

Authors Rolf Floren

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90096-Z

zbMATH Keywords

program specificationSteiner tree approximation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner tree problem in graphs
• scientific article; zbMATH DE number 169458
• scientific article; zbMATH DE number 4063109
• scientific article; zbMATH DE number 1305435
• scientific article; zbMATH DE number 4049088
• Faster approximation algorithms for the rectilinear Steiner tree problem
• An approximation algorithm for the Steiner connectivity problem
• scientific article; zbMATH DE number 222076

Cites work

• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs

Cited in

(8)

• scientific article; zbMATH DE number 426374 (Why is no real title available?)
• scientific article; zbMATH DE number 125502 (Why is no real title available?)
• scientific article; zbMATH DE number 169458 (Why is no real title available?)
• scientific article; zbMATH DE number 2073988 (Why is no real title available?)
• A faster approximation algorithm for the Steiner problem in graphs
• Heuristic algorithms for packing of multiple-group multicasting
• A note on computational aspects of the Steiner traveling salesman problem
• A factoring approach for the Steiner tree problem in undirected networks

This page was built for publication: A note on A faster approximation algorithm for the Steiner problem in graphs

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