Finding All Hops k-Shortest Paths

Document Type

Conference Proceeding

Publication Date

11-7-2003

Abstract

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 computational complexity lower than that of AHKPEB.

Identifier

0142199431 (Scopus)

Publication Title

IEEE Pacific RIM Conference on Communications Computers and Signal Processing Proceedings

First Page

474

Last Page

477

Volume

I

This document is currently not available here.

Share

COinS