A Lower Bound for the Shortest Path Problem.
Ketan MulmuleyPradyut ShahPublished in: J. Comput. Syst. Sci. (2001)
Keyphrases
- shortest path problem
- lower bound
- shortest path
- upper bound
- branch and bound algorithm
- interval data
- single source
- combinatorial optimization problems
- objective function
- directed graph
- multiple objectives
- branch and bound
- optimal solution
- lower bounding
- np hard
- directed acyclic graph
- lower and upper bounds
- bi objective
- sufficiently accurate
- worst case
- competitive ratio
- optimization problems
- cost function
- learning theory
- dynamic programming
- online algorithms
- learning algorithm