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

Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada. On the approximability and hardness of minimum topic connected overlay and its special instances. Theoretical Computer Science, 429:144-154, 2012. [doi]

Abstract

Abstract is missing.