On efficient implementation of an approximation algorithm for the Steiner tree problem
From MaRDI portal
Publication:911286
DOI10.1007/BF00264613zbMATH Open0696.68064OpenAlexW2067344353MaRDI QIDQ911286FDOQ911286
Authors: Lawrence T. Kou 
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264613
Recommendations
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- scientific article; zbMATH DE number 1834686
- 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 139910
- Improved Approximations for the Steiner Tree Problem
- scientific article; zbMATH DE number 742979
- On approximation algorithms for the terminal Steiner tree problem
- scientific article; zbMATH DE number 4049088
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (12)
- The Power of Dynamic Distance Oracles
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Title not available (Why is that?)
- A linear time algorithm for full Steiner trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- An 11/6-approximation algorithm for the network Steiner problem
- Steiner's problem in graphs: Heuristic methods
- A faster approximation algorithm for the Steiner problem in graphs
- A faster approximation algorithm for the Steiner problem in graphs
- A faster implementation of the Goemans-Williamson clustering algorithm
- Title not available (Why is that?)
This page was built for publication: On efficient implementation of an approximation algorithm for the Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911286)
