Login / Signup
Approximability of unsplittable shortest path routing problems.
Andreas Bley
Published in:
Networks (2009)
Keyphrases
</>
shortest path
routing problem
routing algorithm
shortest path problem
approximation algorithms
travel time
weighted graph
path length
shortest path algorithm
road network
depth first search
shortest distance
path selection
optimal path
steiner tree
flow graph
search algorithm