Overlays with preferences: Approximation algorithms for matching with preference lists.
Giorgos GeorgiadisMarina PapatriantafilouPublished in: IPDPS (2010)
Keyphrases
- approximation algorithms
- user preferences
- np hard
- preference elicitation
- soft constraints
- individual preferences
- special case
- qualitative preferences
- preference relations
- vertex cover
- worst case
- multi attribute
- network design problem
- minimum cost
- facility location problem
- multiple criteria
- combinatorial auctions
- randomized algorithms
- approximation ratio
- np hardness
- precedence constraints
- primal dual
- social choice
- set cover
- open shop
- approximation schemes
- constant factor
- multi criteria
- constraint satisfaction problems
- disjoint paths
- peer to peer
- constant factor approximation
- polynomial time approximation
- undirected graph
- personal preferences
- partial order
- cp nets
- preference criteria