A note on A faster approximation algorithm for the Steiner problem in graphs
From MaRDI portal
Publication:1178221
DOI10.1016/0020-0190(91)90096-ZzbMath0739.68071MaRDI QIDQ1178221
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
A factoring approach for the Steiner tree problem in undirected networks ⋮ Heuristic algorithms for packing of multiple-group multicasting
Cites Work
This page was built for publication: A note on A faster approximation algorithm for the Steiner problem in graphs
