Tight Approximation Ratio for Minimum Maximal Matching.
Szymon DudyczMateusz LewandowskiJan MarcinkowskiPublished in: IPCO (2019)
Keyphrases
- approximation ratio
- approximation algorithms
- np hard
- minimum cost
- worst case
- greedy algorithm
- matching algorithm
- special case
- lower bound
- upper bound
- minimum distance
- pattern matching
- search algorithm
- matching process
- graph matching
- feature matching
- approximately optimal
- object recognition
- constant factor
- greedy algorithms
- keypoints
- square error
- data sets
- feature points
- cost function
- face recognition
- information retrieval
- neural network