A polynomial time algorithm for finding an approximate shortest path amid weighted regions.

Rajasekhar Inkulu Sanjiv Kapoor

Published in: CoRR (2015)

Keyphrases

shortest path
shortest path problem
dynamic programming
dijkstra algorithm
shortest path algorithm
segmentation algorithm
optimal path
finding the shortest path
search space
weighted graph
optimal solution
minimum spanning tree
path length
path planning
np hard
objective function
graph partitioning
path selection