𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest-path network interdiction

✍ Scribed by Eitan Israeli; R. Kevin Wood

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
194 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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
Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri