Popular Matching in Roommates Setting is NP-hard.
Sushmita GuptaPranabendu MisraSaket SaurabhMeirav ZehaviPublished in: Bull. EATCS (2020)
Keyphrases
- np hard
- matching algorithm
- scheduling problem
- np complete
- pattern matching
- optimal solution
- maximum weight
- graph matching
- matching process
- approximation algorithms
- computational complexity
- worst case
- image matching
- affine invariant
- integer programming
- knapsack problem
- greedy heuristic
- special case
- computationally hard
- decision trees
- polynomial time approximation
- partial order
- template matching
- decision problems
- feature points
- linear programming
- multiscale