Finding all hops k-shortest paths

@article{Cheng2003FindingAH,
  title={Finding all hops k-shortest paths},
  author={Gang Cheng and Nirwan Ansari},
  journal={2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490)},
  year={2003},
  volume={1},
  pages={474-477 vol.1}
}
In this paper, we introduce and investigate a new problem referred to as the all hops k-shortest paths (AHKP) problem. An efficient solution, the all hops k-shortest paths extended Bellman-Ford (AHKPEB) algorithm, is proposed. Especially, when k = 1, AHKPEB is an optimal comparison-based solution to the all hops optimal path (AHOP) problem in terms of the worst-case computational complexity, i.e., it is impossible to find another comparison-based solution to add-AHOP having the worst-case… CONTINUE READING