@inproceedings{dos1999LabelingAF,
title={Labeling Algorithms for Ranking Shortest Paths},
author={Luis Esteves dos and Santosfeqvm},
year={1999}
}

Luis Esteves dos, Santosfeqvm

Published 1999

In this paper the ranking of shortest paths problem is viewed as a generalization of the shortest path problem, since the K shortest paths have to be computed. Finitness and boundness are studied as well as conditions are established in order that an Optimality Principle generalization is satissed. Under these conditions the K shortest paths can be determined by a natural generalization of forms of the labeling algorithm for the shortest path problem. This generalization is the main subject of… CONTINUE READING