On the hardness and approximation of minimum topic-connected overlay

Monika Steinová. On the hardness and approximation of minimum topic-connected overlay. In Cyril Gavoille, Pierre Fraigniaud, editors, Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011. pages 295-296, ACM, 2011. [doi]

Abstract

Abstract is missing.