A faster approximation algorithm for the Steiner tree problem in graphs
From MaRDI portal
Publication:1802062
DOI10.1016/0020-0190(93)90201-JzbMath0770.68078OpenAlexW2032228390MaRDI QIDQ1802062
Publication date: 8 August 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90201-j
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
The Influence of Preprocessing on Steiner Tree Approximations, Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem, An improved approximation scheme for the Group Steiner Problem, Solving Steiner trees: Recent advances, challenges, and perspectives, The Clustered Selected-Internal Steiner Tree Problem, Strong Steiner Tree Approximations in Practice, Approximating the tree and tour covers of a graph, Steiner trees and polyhedra, Digital data networks design using genetic algorithms
Cites Work