Popular Matching in Roommates Setting Is NP-hard.
Sushmita GuptaPranabendu MisraSaket SaurabhMeirav ZehaviPublished in: ACM Trans. Comput. Theory (2021)
Keyphrases
- np hard
- special case
- matching algorithm
- minimum cost
- image matching
- scheduling problem
- np complete
- maximum weight
- linear programming
- pattern matching
- computationally hard
- np hardness
- feature matching
- closely related
- databases
- keypoints
- constraint satisfaction problems
- object recognition
- knapsack problem
- integer programming
- computational complexity
- optimal solution
- matching scheme
- bayesian networks
- case study
- machine learning