Login / Signup
Exact and approximate algorithms for movement problems on (special classes of) graphs.
Davide Bilò
Luciano Gualà
Stefano Leucci
Guido Proietti
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
exact and approximate
lower bound
optimization problems
query evaluation
data structure
dynamic programming
string matching
polynomial time complexity
lower and upper bounds
graph theory
combinatorial optimization
np complete
pattern recognition
upper bound
data sources
data model
data streams