Login / Signup

NP-hardness results for the aggregation of linear orders into median orders.

Olivier Hudry
Published in: Ann. Oper. Res. (2008)
Keyphrases
  • np hardness
  • np hard
  • computationally efficient
  • approximation algorithms
  • worst case analysis
  • scheduling problem
  • multi dimensional
  • aggregation functions