A Tight Amortized Bound for Path Reversal.
David GinatDaniel Dominic SleatorRobert Endre TarjanPublished in: Inf. Process. Lett. (1989)
Keyphrases
- worst case
- upper bound
- lower bound
- np hard
- running times
- error bounds
- shortest path
- generalization error bounds
- real time
- objective function
- multiscale
- information systems
- multi agent systems
- relational databases
- data structure
- optimal solution
- multi class
- path planning
- bayesian networks
- space complexity
- minimum cost
- artificial intelligence