Login / Signup

A Special Case of the Dynamization Problem for Least Cost Paths.

Davide Crippa
Published in: Inf. Process. Lett. (1991)
Keyphrases
  • decision trees
  • special case
  • np hard
  • approximation algorithms
  • computational complexity
  • optimal path
  • case study
  • shortest path
  • multiple paths
  • web services
  • search algorithm
  • lower bound
  • path planning