A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.
Debarati DasMaximilian Probst GutenbergChristian Wulff-NilsenPublished in: SODA (2022)
Keyphrases
- dynamic programming
- improved algorithm
- optimization algorithm
- selection algorithm
- k means
- learning algorithm
- times faster
- high accuracy
- cost function
- real time
- computational cost
- detection algorithm
- linear programming
- worst case
- experimental evaluation
- evolutionary algorithm
- preprocessing
- probabilistic model
- multi objective
- search space
- clustering method
- ant colony optimization
- matching algorithm
- computational complexity
- convergence rate
- similarity measure
- neural network