All pairs lightest shortest paths

Uri Zwick*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

15 Scopus citations


Two vertices in a weighted directed graph may be connected by many shortest paths. Although all these paths are shortest in terms of weight, the number of edges on them may vary substantially, which leads in considering the all pairs lightest shortest paths (APLSP) problem. A solution to this problem is a representation of shortest paths between all of pairs of vertices in the graph such that each of these shortest paths uses a minimal, or a close to minimal, number of edges. Algorithms for obtaining exact or approximate solutions to the APLSP problem are presented. These results extend the results obtained recently for the all pairs shortest paths (APSP) problem.

Original languageEnglish
Pages (from-to)61-69
Number of pages9
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 1999
EventProceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA
Duration: 1 May 19994 May 1999


Dive into the research topics of 'All pairs lightest shortest paths'. Together they form a unique fingerprint.

Cite this