Partial kernelization for rank aggregation: Theory and experiments

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

Volumn 6478 LNCS, Issue , 2010, Pages 26-37

  Betzler, Nadja ^a   Bredereck, Robert ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; IMPROVE-A; KERNELIZATION; NP COMPLETE; POLYNOMIAL-TIME; PROBLEM KERNEL; RANK AGGREGATION; REAL-WORLD; REDUCTION RULES; WEB SEARCHES;

BIOINFORMATICS; DATA REDUCTION; INFORMATION RETRIEVAL; OPTIMIZATION;

WORLD WIDE WEB;

EID: 78650872658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17493-3_5     Document Type: Conference Paper

References (18)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. Journal of the ACM 55(5), Article 23 (2008)
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. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science 410(45), 4554-4570 (2009)
4. Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization and partial kernelization for computing medians. Journal of Computer and System Sciences (2010), doi:10.1016/j.jcss.2010.07.005
5. Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proc. of 21st AAAI, pp. 620-626. AAAI Press, Menlo Park (2006)
6. Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proc. of 19th AAAI, pp. 697-702. AAAI Press, Menlo Park (2004)
7. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: Proc. of 10th WWW, pp. 613-622 (2001)
8. Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proc. of 22nd ACM SIGMOD, pp. 301-312. ACM, New York (2003)
9. Jackson, B.N., Schnable, P.S., Aluru, S.: Consensus genetic maps as median orders from inconsistent sources. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(2), 161-171 (2008)
10. Karpinski, M., Schudy, W.: Approximation schemes for the betweenness problem in tournaments and related ranking problems. In: Proc. of 21st ISAAC (to appear, 2010)
11. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proc. of 39th STOC, pp. 95-103. ACM, New York (2007)
12. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. Journal of Computer and System Sciences 75, 137-153 (2009)
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. Schalekamp, F., van Zuylen, A.: Rank aggregation: Together we're strong. In: Proc. of 11th ALENEX, pp. 38-51. SIAM, Philadelphia (2009)
16. Simjour, N.: Improved parameterized algorithms for the Kemeny aggregation problem. In: Proc. of 4th IWPEC. LNCS, vol. 5917, pp. 312-323. Springer, Heidelberg (2009)
17. van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Mathematics of Operations Research 34, 594-620 (2009)
18. Young, H., Levenglick, A.: A consistent extension of Condorcet's election principle. SIAM Journal on Applied Mathematics 35(2), 285-300 (1978)