Shortest viable hyperpath in multimodal networks
✍ Scribed by Angélica Lozano; Giovanni Storchi
- Book ID
- 117397224
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 255 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0191-2615
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we study the problem of ®nding Origin±Destination (O±D) shortest paths in urban multimodal transportation networks, aiming at minimizing the overall cost, time and users' discommodity associated with the required paths. We present an approach based on the classical shortest path proble
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