Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists.
Giorgos GeorgiadisMarina PapatriantafilouPublished in: Algorithms (2013)
Keyphrases
- approximation algorithms
- user preferences
- np hard
- scalable distributed
- preference elicitation
- special case
- individual preferences
- peer to peer
- preference relations
- minimum cost
- facility location problem
- vertex cover
- multi attribute
- qualitative preferences
- network design problem
- worst case
- distributed systems
- soft constraints
- constant factor
- set cover
- precedence constraints
- approximation ratio
- approximation schemes
- open shop
- primal dual
- multiple criteria
- combinatorial auctions
- multi criteria
- personal preferences
- constraint satisfaction problems
- np hardness
- randomized algorithms