✦ LIBER ✦

On finding shortest paths in nonnegative networks

✍ Scribed by A. Rosenthal

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 438 KB
Volume: 10
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90027-2

No coin nor oath required. For personal study only.

✦ Synopsis

A modification of Dantzig's algorithm for the all! pairs shortest paths problem is given. The new algorithm applies only to graphs with nonnegative arc lengths. For an IV-node compkte graph ir has a worst case running time of fN3 triple operations of the form D-: = min(D--D-~+D~$ and iv" log N other comparisons. This contrasts with a lower bound of N(; -'iI (3 -2) 'E;ipf in any pure triple o s"

ratron algorithm, and s+ems to be the first algorithm in which no operation nwi bc repeated !'V times. Sparsity and some other conditions may also bc: utilized.

📜 SIMILAR VOLUMES

Finding the Kth shortest path in a time-

Finding the Kth shortest path in a time-schedule network

✍ Yen-Liang Chen; Kwei Tang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

Shortest-Path Routing in Arbitrary Netwo

Shortest-Path Routing in Arbitrary Networks

✍ Friedhelm Meyer auf der Heide; Berthold Vöcking 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ž . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for

On the complexity of finding paths in a

On the complexity of finding paths in a two-dimensional domain I: Shortest paths

✍ Arthur W. Chou; Ker-I Ko 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Shortest paths in networks with exponent

Shortest paths in networks with exponentially distributed arc lengths

✍ V. G. Kulkarni 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB