✦ LIBER ✦

Shortest shortest path trees of a network

✍ Scribed by Pierre Hansen; Maolin Zheng

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 664 KB
Volume: 65
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00038-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest-path network interdiction

✍ Eitan Israeli; R. Kevin Wood 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

A note on finding shortest path trees

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

Balancing minimum spanning trees and sho

Balancing minimum spanning trees and shortest-path trees

✍ S. Khuller; B. Raghavachari; N. Young 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 897 KB

A shortest path metric on unlabeled bina

A shortest path metric on unlabeled binary trees

✍ André Bonnin; Jean-Marcel Pallo 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 298 KB

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

Shortest path network interdiction with

Shortest path network interdiction with asymmetric information

✍ Halil Bayrak; Matthew D. Bailey 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB