Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances

DOI10.1016/J.TCS.2014.11.001zbMATH Open1303.68061OpenAlexW2035171555MaRDI QIDQ476920FDOQ476920

Authors: Jun Hosoda, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada, 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

Recommendations

• scientific article; zbMATH DE number 2119765
• Correction to: ``Weighted upper edge cover: complexity and approximability
• Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
• On the approximability of minimum topic connected overlay and its special instances
• Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cites Work

• On the approximability and hardness of minimum topic connected overlay and its special instances
• Effective and efficient data reduction for the subset interconnection design problem

Cited In (3)

• Correction to: ``Weighted upper edge cover: complexity and approximability
• On the approximability and hardness of minimum topic connected overlay and its special instances
• On the approximability of minimum topic connected overlay and its special instances

This page was built for publication: Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476920)