On the Internal Steiner Tree Problem
From MaRDI portal
Publication:5425440
DOI10.1007/978-3-540-72504-6_25zbMath1198.68182OpenAlexW1568391568MaRDI QIDQ5425440
Sun-Yuan Hsieh, Shih-Cheng Yang, Huang-Ming Gao
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
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ Algorithms for the minimum diameter terminal Steiner tree problem
This page was built for publication: On the Internal Steiner Tree Problem