Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances
From MaRDI portal
Publication:476920
DOI10.1016/j.tcs.2014.11.001zbMath1303.68061OpenAlexW2035171555MaRDI QIDQ476920
Jun Hosoda, Taisuke Izumi, Monika Steinová, Koichi Wada, Hirotaka Ono, Juraj Hromkovič
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.001
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work