Shortest-Path Routing in Arbitrary Networks
From MaRDI portal
Publication:4240129
DOI10.1006/JAGM.1998.0980zbMATH Open0928.68006OpenAlexW2009862698MaRDI QIDQ4240129FDOQ4240129
Authors: Friedhelm Meyer auf der Heide, Berthold Vöcking 
Publication date: 9 January 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1998.0980
Recommendations
Cited In (25)
- A simple routing algorithm based on Schnyder coordinates
- 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
- Title not available (Why is that?)
- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
- Routing in graphs
- Upgrading Shortest Paths in Networks
- Title not available (Why is that?)
- 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
- Shortest-path queries in static networks
- Single backup table schemes for shortest-path routing
- 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
- Oblivious routing for sensor network topologies
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)
