On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
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
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On the approximability of minimum topic connected overlay and its special instances
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
The design of a scalable overlay network to support decentralized topic-based publish/subscribe communication is nowadays a problem of a great importance. We investigate here special instances of one such design problem called Minimum Topic-Connected Overlay. Given a collection of 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. We investigate instances where in addition the number of users interested in a particular topic is bounded by a constant d 2. It is known that the general Topic-Connected Overlay is Ω(log n) hard to approximate and approximable by a logarithmic factor. For our special instances, we design a one-to-one reduction to special instances of the hitting set problem. This allows us to present the first constant approximation algorithm, the first kernelization and the first nontrivial exact algorithm for the special instances discussed.