Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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

Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-02698005
Contributor : Claire Mathieu Connect in order to contact the contributor
Submitted on : Monday, June 1, 2020 - 11:45:54 AM
Last modification on : Monday, June 1, 2020 - 11:45:54 AM

Links full text

Identifiers

Citation

Claire Mathieu, Simon Mauras. How to aggregate Top-lists: Approximation algorithms via scores and average ranks. Proceedings of the 2020 Symposium on Discrete Algorithms, 2020, Jan 2020, Salt Lake City, United States. pp.2810-2822, ⟨10.1137/1.9781611975994.171⟩. ⟨hal-02698005⟩

Share

Metrics

Record views

20