Improved parameterized algorithms for the Kemeny aggregation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 312-323

  Simjour, Narges ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Enumeration; Exact algorithms; Kemeny score; Parameterized

Indexed keywords

EXACT ALGORITHMS; FIXED PARAMETERS; OPTIMAL SOLUTIONS; PARAMETERIZED; PARAMETERIZED ALGORITHM; POLYNOMIAL FACTOR; PREFERENCE LISTS; RUNNING TIME; TOTAL ORDER;

ALGORITHMS;

EID: 72549096316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_26     Document Type: Conference Paper

References (13)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of the ACM 55(5), 1-27 (2008)
2. Bartholdi, J.J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6(2), 157-165 (1989)
3. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixedparameter algorithms for Kemeny scores. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 60-71. Springer, Heidelberg (2008)
4. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: How similarity helps to efficiently compute Kemeny rankings. In: AAMAS 2009: Proc. of the 8th Int. Conf. on Autonomous Agents and Multiagent Systems, pp. 657-664 (2009)
5. Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 1-12. Springer, Heidelberg (2006)
6. Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5(1), 5-60 (2007)
7. Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: AAAI 2004: Proc. of the 19th National Conf. on Artificial Intelligence, pp. 697-702 (2004)
8. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW 2001: Proc. of the 10th Int. Conf. on World Wide Web, pp. 613-622 (2001)
9. Kemeny, J.G.: Mathematics without numbers. Daedalus 88, 575-591 (1959)
10. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007: Proc. of the 39th Annual ACM Symp. on Theory of Computing, pp. 95-103 (2007)
11. Monjardet, B.: Tournois et ordres médians pour une opinion. Mathématiques et Sciences humaines, 55-73 (1973)
12. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351(3), 446-458 (2006)
13. Williamson, D.P., van Zuylen, A.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260-273. Springer, Heidelberg (2008)