On the hardness of full Steiner tree problems

Abu-Affash, 2015, The Euclidean bottleneck full Steiner tree problem, Algorithmica, 71, 139, 10.1007/s00453-013-9788-x Bartal, 1998, On approximating arbitrary metrics by tree metrics, 161 Biniaz, 2014, Approximating full Steiner tree in a unit disk graph Biniaz, 2014, An optimal algorithm for the Euclidean bottleneck full Steiner tree problem, Comput. Geom., 47, 377, 10.1016/j.comgeo.2013.10.001 Charikar, 1999, Approximation algorithms for directed Steiner problems, J. Algorithms, 33, 73, 10.1006/jagm.1999.1042 Chen, 2011, An improved approximation algorithm for the terminal Steiner tree problem, 141 Chen, 2003, On the full and bottleneck full Steiner tree problems, 122 Demaine, 2014, Node-weighted Steiner tree and group Steiner tree in planar graphs, ACM Trans. Algorithms, 10, 13:1, 10.1145/2601070 Drake, 2004, On approximation algorithms for the terminal Steiner tree problem, Inf. Process. Lett., 89, 15, 10.1016/j.ipl.2003.09.014 Elbassioni, 2012, The relation of connected set cover and group Steiner tree, Theor. Comput. Sci., 438, 96, 10.1016/j.tcs.2012.02.035 Fakcharoenphol, 2004, A tight bound on approximating arbitrary metrics by tree metrics, J. Comput. Syst. Sci., 69, 485, 10.1016/j.jcss.2004.04.011 Feige, 1998, A threshold of ln⁡n for approximating set cover, J. ACM, 45, 634, 10.1145/285055.285059 Fuchs, 2003, A note on the terminal Steiner tree problem, Inf. Process. Lett., 87, 219, 10.1016/S0020-0190(03)00285-0 Garey, 1979 Garg, 2000, A polylogarithmic approximation algorithm for the group Steiner tree problem, J. Algorithms, 37, 66, 10.1006/jagm.2000.1096 Guha, 1999, Improved methods for approximating node weighted Steiner trees and connected dominating sets, Inf. Comput., 150, 57, 10.1006/inco.1998.2754 Halperin, 2003, Polylogarithmic inapproximability, 585 Hsieh, 2008, On the partial-terminal Steiner tree problem, 173 Khandekar, 2012, Approximating fault-tolerant group-Steiner problems, Theor. Comput. Sci., 416, 55, 10.1016/j.tcs.2011.08.021 Klein, 1995, A nearly best-possible approximation algorithm for node-weighted Steiner trees, J. Algorithms, 19, 104, 10.1006/jagm.1995.1029 Lin, 2002, On the terminal Steiner tree problem, Inf. Process. Lett., 84, 103, 10.1016/S0020-0190(02)00227-2 Martinez, 2007, Algorithms for terminal Steiner trees, Theor. Comput. Sci., 389, 133, 10.1016/j.tcs.2007.08.001 Naor, 2011, Online node-weighted Steiner tree and related problems, 210 Rothvoß Shuai, 2006, Connected set cover problem and its applications, 243 Zou, 2009, Node-weighted Steiner tree approximation in unit disk graphs, J. Comb. Optim., 18, 342, 10.1007/s10878-009-9229-6