On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
DOI10.1007/978-3-642-22993-0_35zbMath1343.68096arXiv1107.2443OpenAlexW16760454MaRDI QIDQ3088055
Koichi Wada, Jun Hosoda, Monika Steinová, Hirotaka Ono, Taisuke Izumi, Juraj Hromkovič
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2443
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
