Fully dynamic all-pairs shortest paths with worst-case update-time revisited.

Ittai Abraham Shiri Chechik Sebastian Krinninger

Published in: CoRR (2016)

Keyphrases

worst case
artificial intelligence
dynamically updated
genetic algorithm
lower bound
np hard
dynamic environments
real world
metadata
multiscale
artificial neural networks
upper bound
shortest path
greedy algorithm