The internal Steiner tree problem: Hardness and approximations
DOI10.1016/j.jco.2012.08.005zbMath1256.68131OpenAlexW1967576404MaRDI QIDQ1931427
Chia-Wei Lee, Huang-Ming Gao, Sun-Yuan Hsieh, Chao-Wen Huang
Publication date: 14 January 2013
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2012.08.005
approximation algorithmsSteiner treesVLSI routingdesign and analysis of algorithmsMAX SNP-hardnessthe internal Steiner tree problem
Analysis of algorithms (68W40) Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (6)
This page was built for publication: The internal Steiner tree problem: Hardness and approximations