Efficient approximation algorithms for computing k disjoint constrained shortest paths.

Published in: J. Comb. Optim. (2016)

Keyphrases

approximation algorithms
shortest path
np hard
special case
vertex cover
road network
worst case
minimum cost
primal dual
set cover
shortest path algorithm
path length
optimal path
flow graph
randomized algorithms
travel time
transportation networks
open shop
minimum cost flow