Author:
Censor-Hillel Keren,Levy Rina,Shachnai Hadas
Publisher
Springer International Publishing
Reference51 articles.
1. Lecture Notes in Computer Science;M Åstrand,2009
2. Åstrand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 294–302. ACM (2010)
3. Bar-Yehuda, R., Censor-Hillel, K., Schwartzman, G.: A distributed (2+ $$\epsilon $$ ϵ )-approximation for vertex cover in O(log $$\varDelta $$ Δ / $$\epsilon $$ ϵ log log $$\varDelta $$ Δ ) rounds. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25–28 July 2016, pp. 3–8 (2016)
4. Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493–513 (1988)
5. da Ponte Barbosa, R., Ene, A., Nguyen, H.L., Ward, J.: A new framework for distributed submodular maximization. arXiv preprint http://arxiv.org/abs/1507.03719 (2015)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献