On efficient implementation of an approximation algorithm for the Steiner tree problem
From MaRDI portal
Publication:911286
DOI10.1007/BF00264613zbMath0696.68064OpenAlexW2067344353MaRDI QIDQ911286
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264613
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
An 11/6-approximation algorithm for the network Steiner problem ⋮ Steiner's problem in graphs: Heuristic methods
This page was built for publication: On efficient implementation of an approximation algorithm for the Steiner tree problem
