Algorithms for terminal Steiner trees

DOI10.1016/J.TCS.2007.08.001zbMATH Open1143.68061OpenAlexW1989076933MaRDI QIDQ2465633FDOQ2465633

Authors: Yanyan Li 

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.08.001

Recommendations

• Computing and Combinatorics
• 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

zbMATH Keywords

approximation algorithmsterminal Steiner trees

Mathematics Subject Classification ID

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

Cites Work

• Tighter Bounds for Graph Steiner Tree Approximation
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• On approximation algorithms for the terminal Steiner tree problem
• On the terminal Steiner tree problem.
• On the full and bottleneck full Steiner tree problems
• The Steiner problem with edge lengths 1 and 2
• A note on the terminal Steiner tree problem
• The full Steiner tree problem

Cited In (20)

• On the terminal Steiner tree problem.
• A polylogarithmic approximation for computing non-metric terminal Steiner trees
• The Euclidean bottleneck full Steiner tree problem
• On full Steiner trees in unit disk graphs
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• A note on the terminal Steiner tree problem
• On the clustered Steiner tree problem
• Computing and Combinatorics
• Steiner Trees for Terminals Constrained to Curves
• A multivariate analysis of the strict terminal connection problem
• On the Clustered Steiner Tree Problem
• The minimum spanning tree problem with non-terminal set
• Robust Algorithms for TSP and Steiner Tree
• An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
• Minimum diameter cost-constrained Steiner trees
• Algorithms for the minimum diameter terminal Steiner tree problem
• On the hardness of full Steiner tree problems
• A better constant-factor approximation for selected-internal Steiner minimum tree
• Combination algorithms for Steiner tree variants
• On approximation algorithms for the terminal Steiner tree problem

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 Q2465633)