Algorithms for terminal Steiner trees

DOI10.1007/11533719_38MaRDI QIDQ5716954zbMATH OpenOpenAlexFDO

Authors Fábio Viduani Martinez, José C. de Pina, José F. Soares

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Algorithms for terminal Steiner trees
• Approximation algorithms for the terminal Steiner tree problem
• On approximation algorithms for the terminal Steiner tree problem
• Algorithms for the minimum diameter terminal Steiner tree problem
• On the terminal Steiner tree problem.
• A note on the terminal Steiner tree problem
• scientific article; zbMATH DE number 3972878
• An Improved Algorithm for Steiner Trees

Cited in

(12)

• A note on the terminal Steiner tree problem
• On approximation algorithms for the terminal Steiner tree problem
• On the terminal Steiner tree problem.
• Algorithms for terminal Steiner trees
• Combination algorithms for Steiner tree variants
• Steiner Trees for Terminals Constrained to Curves
• A polylogarithmic approximation for computing non-metric terminal Steiner trees
• Algorithms for the minimum diameter terminal Steiner tree problem
• Multi-level Steiner trees
• Approximation algorithms for the terminal Steiner tree problem
• Robust Algorithms for TSP and Steiner Tree
• An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2

This page was built for publication: Algorithms for terminal Steiner trees

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