The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases.
Julien LescaMichel MinouxPatrice PernyPublished in: Algorithmica (2019)
Keyphrases
- np hardness
- np hard
- special case
- approximation algorithms
- np complete
- computational complexity
- worst case
- scheduling problem
- linear programming
- optimal solution
- aggregation operators
- classifier fusion
- linear program
- lower bound
- discrete tomography
- worst case analysis
- decision problems
- ordered weighted averaging
- heuristic search