How to aggregate Top-lists: Approximation algorithms via scores and average ranks.
Claire MathieuSimon MaurasPublished in: SODA (2020)
Keyphrases
- approximation algorithms
- inter document similarities
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- set cover
- approximation ratio
- ranked list
- approximation schemes
- network design problem
- constant factor
- randomized algorithms
- open shop
- exact algorithms
- np hardness
- precedence constraints
- primal dual
- undirected graph
- constant factor approximation