Author:
Gupta Sushmita,Jain Pallavi,Roy Sanjukta,Saurabh Saket,Zehavi Meirav
Funder
Science and Engineering Research Board
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., & Skowron, P. (2017). The Condorcet principle for multiwinner elections: From shortlisting to proportionality. In: IJCAI, pp. 84–90.
2. Bar-Yehuda, R., & Even, S. (1981). A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2(2), 198–203.
3. Chen, J., Kanj, I. A., & Xia, G. (2010). Improved upper bounds for vertex cover. Theoretical Computer Science, 411(40–42), 3736–3756.
4. Coelho, D. (2005). Understanding, evaluating and selecting voting rules through games and axioms. Bellaterra: Universitat Autònoma de Barcelona.
5. Condorcet, M. D. (1785). Essai sur l’application de l’analyse, a la probabilite des decisions rendues a la pluralite des voix. A Paris, De L'imprimerie Royal, M. DCC LXX V.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献