Shortest-Path Routing in Arbitrary Networks

DOI10.1006/JAGM.1998.0980MaRDI QIDQ4240129zbMATH OpenOpenAlexFDO

Authors Friedhelm Meyer auf der Heide, Berthold Vöcking

Publication date 9 January 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/jagm.1998.0980

zbMATH Keywords

shortest pathsrouting problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A packet routing protocol for arbitrary networks
• Asymptotic optimality of shortest path routing algorithms
• scientific article; zbMATH DE number 1305398
• scientific article; zbMATH DE number 1173684

Cited in

(25)

• A simple routing algorithm based on Schnyder coordinates
• Oblivious routing for sensor network topologies
• Worst Case Bounds for Shortest Path Interval Routing
• Shortest path problems with node failures
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Stackelberg Routing in Arbitrary Networks
• scientific article; zbMATH DE number 1990700 (Why is no real title available?)
• Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
• Routing in graphs
• Upgrading Shortest Paths in Networks
• scientific article; zbMATH DE number 7093019 (Why is no real title available?)
• Shortest routing in trivalent Cayley graph network
• Asymptotic optimality of shortest path routing algorithms
• Shortest shortest path trees of a network
• An oblivious shortest-path routing algorithm for fully connected cubic networks
• Short-length routes in low-cost networks via Poisson line patterns
• Universal packet routing with arbitrary bandwidths and transit times
• Direct routing: Algorithms and complexity
• Single backup table schemes for shortest-path routing
• Shortest-path queries in static networks
• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
• Network-Tree Model and Shortest Path Algorithm
• An efficient shortest-path routing algorithm in the data centre network DPillar
• Shortest paths in networks with vector weights
• A packet routing protocol for arbitrary networks

This page was built for publication: Shortest-Path Routing in Arbitrary Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240129)