Exact and approximate algorithms for movement problems on (special classes of) graphs.

Davide Bilò Luciano Gualà Stefano Leucci Guido Proietti

Published in: CoRR (2014)

Keyphrases

exact and approximate
lower bound
graph theory
optimization problems
combinatorial optimization
string matching
lower and upper bounds
np complete
objective function
high dimensional
machine learning algorithms
classification algorithm
query evaluation
polynomial time complexity