Partial Kernelization for Rank Aggregation: Theory and Experiments

RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of four input rankings to be aggregated into a "median ranking". We study efficient polynomial-time data reduction rules that allow us to find optimal median rankings. On the theoretical side, we improve a result for a "partial problem kernel" from quadratic to linear size. On the practical side, we provide encouraging experimental results with data based on web search and sport competitions, e.g., computing optimal median rankings for real-world instances with more than 100 candidates within milliseconds.

• Type: Journal
• Year: 2010
• Where: IWPEC
• Authors: Nadja Betzler, Robert Bredereck, Rolf Niedermeier
• Keywords: Applied Computing, IWPEC 2010, Median Rankings, Optimal Median Rankings, Problem Kemeny Score