On the Internal Steiner Tree Problem

DOI10.1007/978-3-540-72504-6_25MaRDI QIDQ5425440zbMATH OpenOpenAlexFDO

Authors Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_25

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• The internal Steiner tree problem: Hardness and approximations
• MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
• (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
• The Clustered Selected-Internal Steiner Tree Problem
• Approximating the selected-internal Steiner tree

Cited in

(9)

• The internal Steiner tree problem: Hardness and approximations
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
• MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• Algorithms for the minimum diameter terminal Steiner tree problem
• The Clustered Selected-Internal Steiner Tree Problem
• A better constant-factor approximation for selected-internal Steiner minimum tree
• Approximating the selected-internal Steiner tree

This page was built for publication: On the Internal Steiner Tree Problem

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