Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
The problem of identifying the k -shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such …