TY - GEN
T1 - On the approximability of minimum topic connected overlay and its special instances
AU - Hosoda, Jun
AU - Hromkovič, Juraj
AU - Izumi, Taisuke
AU - Ono, Hirotaka
AU - Steinová, Monika
AU - Wada, Koichi
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80052111219&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052111219&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22993-0_35
DO - 10.1007/978-3-642-22993-0_35
M3 - Conference contribution
AN - SCOPUS:80052111219
SN - 9783642229923
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 376
EP - 387
BT - Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings
T2 - 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011
Y2 - 21 August 2011 through 25 August 2011
ER -