Login / Signup
Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths.
Longkun Guo
Kewen Liao
Hong Shen
Peng Li
Published in:
SPAA (2015)
Keyphrases
</>
approximation algorithms
shortest path
np hard
special case
worst case
vertex cover
randomized algorithms
approximation ratio
shortest path algorithm
road network
minimum cost
constant factor
finding the shortest path
traffic flow
primal dual