How to aggregate Top-lists: Approximation algorithms via scores and average ranks

DOI10.1137/1.9781611975994.171MaRDI QIDQ5146967zbMATH OpenOpenAlexFDO

Authors Claire Mathieu, Simon Mauras

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.01537

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• An algorithm for rank aggregation problem
• Heuristic methods for top-k list aggregation under the generalized Kendall tau distance

This page was built for publication: How to aggregate Top-lists: Approximation algorithms via scores and average ranks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146967)