A Collection of Lower Bounds for Online Matching on the Line.
Antonios AntoniadisCarsten FischerAndreas TönnisPublished in: LATIN (2018)
Keyphrases
- lower bound
- online algorithms
- upper bound
- matching algorithm
- matching process
- online learning
- objective function
- branch and bound
- pattern matching
- raster images
- optimal cost
- document collections
- feature points
- worst case
- np hard
- special case
- graph matching
- learning theory
- upper and lower bounds
- quadratic assignment problem
- social networks
- randomly generated problems
- real time