Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.
Niclas BoehmerKlaus HeegerRolf NiedermeierPublished in: CoRR (2022)
Keyphrases
- complexity analysis
- matching algorithm
- theoretical analysis
- problems involving
- lower bound
- optimization problems
- database
- np complete
- data driven
- benchmark problems
- image matching
- application domains
- keypoints
- pattern matching
- high dimensional
- pairwise
- feature space
- objective function
- genetic algorithm
- data sets
- real time