TY - JOUR
T1 - Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429, (2012), 144-154]
AU - Hosoda, Jun
AU - Hromkovič, Juraj
AU - Izumi, Taisuke
AU - Ono, Hirotaka
AU - Steinová, Monika
AU - Wada, Koichi
N1 - Funding Information:
This research is partly supported by the Japan Society for the Promotion of Science , Grant-in-Aid for Scientific Research, 21500013 , 21680001 , 22650004 , 22700010 , 23104511 , 23310104 , foundation for the Fusion of Science Technology (FOST) and Inamori Grants (2009) of Inamori Foundation . The research is also partially funded by SNSF grant 200021-132510/1 .
Publisher Copyright:
© 2014 Elsevier B.V.
PY - 2015
Y1 - 2015
N2 - As was pointed out in [1], Theorem 8 of the paper On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances [2] is incorrect. This corrigendum proves a slightly weaker version of this theorem.
AB - As was pointed out in [1], Theorem 8 of the paper On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances [2] is incorrect. This corrigendum proves a slightly weaker version of this theorem.
UR - http://www.scopus.com/inward/record.url?scp=84926315964&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84926315964&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2014.11.001
DO - 10.1016/j.tcs.2014.11.001
M3 - Comment/debate
AN - SCOPUS:84926315964
SN - 0304-3975
VL - 562
SP - 660
EP - 661
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - C
ER -