Fast computation of clustered many-to-many shortest paths and its application to map matching

• المؤلفون الرئيسيون: Jagadeesh, George Rosario, Srikanthan, Thambipillai
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Engineering::Computer science and engineering; Map Matching; Speed-up Technique
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/145630
• المؤسسة: Nanyang Technological University

We examine the problem of computing shortest paths in a transportation network from a set of geographically clustered source nodes to a set of target nodes. Such many-to-many shortest path computations are an essential and computationally expensive part of many emerging applications that involve map...