Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Algorithmics for Hard Problems
Algorithmics for Hard Problems
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Corona: a high performance publish-subscribe system for the world wide web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics
Inferring social networks from outbreaks
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
On the hardness and approximation of minimum topic-connected overlay
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Semantic peer-to-peer overlays for publish/subscribe networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
FeedTree: sharing web micronews with peer-to-peer event notification
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
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(log t) 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.