Fixed-parameter algorithms for kemeny scores

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

Volumn 5034 LNCS, Issue , 2008, Pages 60-71

  Betzler, Nadja ^a   Fellows, Michael R ^b   Guo, Jiong ^a   Niedermeier, Rolf ^a   Rosamond, Frances A ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; INFORMATION MANAGEMENT; NUCLEAR PROPULSION; PARAMETER ESTIMATION;

ALGORITHMIC ASPECTS; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; INTERNATIONAL CONFERENCES; MAXIMUM DISTANCE; NP-HARD; RANK AGGREGATION; TO MANY;

MATHEMATICAL TRANSFORMATIONS;

EID: 48249152175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68880-8_8     Document Type: Conference Paper

References (16)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. In: Proc. 37th STOC, pp. 684-693. ACM, New York (2005)
2. Bartholdi III, 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, 157-165 (1989)
3. Chen, J.: Personal communication (December 2007)
4. Chen, J., Liu, Y.,Lu,S.,O'Sullivan,B., Razgon, I.:A fixed-parameter algorithm for the directed feedback vertex set problem. In: Proc. 40th STOC, ACM, New York (2008)
5. Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proc. 21st AAAI, pp. 620-626 (2006)
6. Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proc. 19th AAAI, pp. 697-702 (2004)
7. Downey,R.G.,Fellows,M.R.:Parameterized Complexity.Springer, Heidelberg(1999)
8. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: Proc. WWW, pp. 613-622 (2001)
9. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited (manuscript, 2001)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoretical Computer Science 349, 382-391 (2005)
12. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proc. 39th STOC, pp. 95-103. ACM, New York (2007)
13. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
14. Raman, V., Saurabh, S.: Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Information Processing Letters 104(2), 65-72 (2007)
15. Truchon, M.: An extension of the Condorcet criterion and Kemeny orders. Technical report,cahier98-15du CentredeRechercheen Économieet Finance Appliquées(1998)
16. van Zuylen, A., Williamson, D.P.: 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 (2007)