Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem.
Longkun GuoPublished in: FAW (2014)
Keyphrases
- shortest path
- linear programming
- shortest path algorithm
- shortest path problem
- road network
- flow graph
- linear program
- mixed integer
- objective function
- finding the shortest path
- optimal path
- approximation algorithms
- feasible solution
- path length
- pairwise
- travel time
- weighted graph
- optimal solution
- minimum cost flow
- shortest distance
- geodesic distance
- spatial networks
- strongly connected components
- image segmentation