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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

抜粋

In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics, collection of n users together with the lists of topics they are interested in, the aim is to connect these users to a network by a minimum number of edges such that every graph induced by users interested in a common topic is connected. It is known that Min-TCO is NP-hard and approximable within O(logt) in polynomial time. In this paper, we further investigate the problem and some of its special instances. We give various hardness results for instances where the number of users interested in a common topic is constant, and also for the instances where the number of topics in which an user is interested in is bounded by a constant. Furthermore, we close the gap of hardness of Min-TCO by showing its LOGAPX-completeness. We also present a few polynomial-time algorithms for very restricted instances of Min-TCO.

元の言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings
ページ376-387
ページ数12
DOI
出版物ステータス出版済み - 9 1 2011
イベント36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011 - Warsaw, ポーランド
継続期間: 8 22 20118 26 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6907 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011
ポーランド
Warsaw
期間8/22/118/26/11

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Hosoda, J., Hromkovič, J., Izumi, T., Ono, H., Steinová, M., & Wada, K. (2011). On the approximability of minimum topic connected overlay and its special instances. : Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings (pp. 376-387). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6907 LNCS). https://doi.org/10.1007/978-3-642-22993-0_35