Login / Signup
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.
Andreas Bley
Published in:
IPCO (2005)
Keyphrases
</>
routing problem
shortest path
travel time
routing algorithm
shortest path problem
road network
shortest path algorithm
minimum length
optimal path
traffic congestion
path length
mobile networks
ip networks
weighted graph
approximation algorithms
vehicle routing problem
random walk
evolutionary algorithm