Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms.
Moab ArarShiri ChechikSarel CohenCliff SteinDavid WajcPublished in: ICALP (2018)
Keyphrases
- computational cost
- computational complexity
- theoretical analysis
- learning algorithm
- search algorithm
- recently developed
- dynamic environments
- orders of magnitude
- graph theory
- neural network
- shape matching
- memory requirements
- times faster
- data mining algorithms
- computationally efficient
- worst case
- np hard
- data structure
- decision trees
- data mining