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

From MaRDI portal
Publication:418776

DOI10.1016/j.tcs.2011.12.033zbMath1238.68063OpenAlexW2058702473MaRDI QIDQ418776

Monika Steinová, Jun Hosoda, Hirotaka Ono, Taisuke Izumi, Koichi Wada, Juraj Hromkovič

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.033




Related Items (7)



Cites Work


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