On the Complexity of Approximating k-Dimensional Matching.

Elad Hazan Shmuel Safra Oded Schwartz

Published in: RANDOM-APPROX (2003)

Keyphrases

computational complexity
matching algorithm
optimal matching
information systems
worst case
lower complexity
real world
genetic algorithm
web services
expert systems
pattern matching
decision problems
template matching
graph matching
space complexity
matching scheme