Author:
Ackerman Eyal,Ben-Zwi Oren,Wolfovitz Guy
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981
2. An exact almost optimal algorithm for target set selection in social networks;Ben-Zwi,2009
3. Dynamic monopolies of constant size;Berger;J. Combin. Theory, Ser. B,2001
4. Spreading messages;Chang;Theoret. Comput. Sci.,2009
5. C. Chang, Y. Lyuu, Bounding the number of tolerable faults in majority-based systems, in: Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26–28, 2010. Proceedings, 2010, pp. 109–119.
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献