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

DOI10.1016/0020-0190(91)90096-ZzbMATH Open0739.68071MaRDI QIDQ1178221FDOQ1178221

Authors: Rolf Floren 

Publication date: 26 June 1992

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

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
• 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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A factoring approach for the Steiner tree problem in undirected networks
• Title not available (Why is that?)
• A faster approximation algorithm for the Steiner problem in graphs
• Title not available (Why is that?)
• A note on computational aspects of the Steiner traveling salesman problem
• Heuristic algorithms for packing of multiple-group multicasting

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)