Login / Signup
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization.
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
Published in:
SIAM J. Comput. (2016)
Keyphrases
</>
dynamic environments
artificial intelligence
bayesian networks
probabilistic model
shortest path
databases
machine learning
search engine
computer vision
decision trees
high quality
scheduling problem
least squares
changing environment
dynamically changing