Approximation algorithms for the terminal Steiner tree problem

MaRDI QIDQ5237808zbMATH OpenFDO

Authors Yen Hung Chen, Ying-Chih Lin

Publication date 25 October 2019

Full work available at URL http://acmij.az/view.php?lang=az&menu=journal&id=478

zbMATH Keywords

approximation algorithmsapproximation schemeevolutionary tree reconstruction in biologynetwork communicationNP-completenessSteiner treetelecommunicationsterminal Steiner tree problem

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• On approximation algorithms for the terminal Steiner tree problem
• On the terminal Steiner tree problem.
• Tighter Bounds for Graph Steiner Tree Approximation
• Computing and Combinatorics
• Algorithms for terminal Steiner trees

Cited in

(10)

• A note on the terminal Steiner tree problem
• On approximation algorithms for the terminal Steiner tree problem
• A polynomial time approximation scheme for the grade of service Steiner minimum tree problem
• On the terminal Steiner tree problem.
• Algorithms for terminal Steiner trees
• The influence of preprocessing on Steiner tree approximations
• scientific article; zbMATH DE number 2044939 (Why is no real title available?)
• scientific article; zbMATH DE number 5042868 (Why is no real title available?)
• Computing and Combinatorics
• An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2

This page was built for publication: Approximation algorithms for the terminal Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237808)