Energy-efficient air-indices for shortest path and distance queries on road networks
作者：
Highlights：
• We have rewritten Section 1 (Introduction), Section 2 (Previous and Related Work), and Section 3.1 (System Model and Assumptions) to address Comment 1 and 2 of Area Editor, Comment 9, 10 and 11 of Reviewer 1, and Comment 1 of Reviewer 2, etc.
• We have added fve new fgures (Figures 5, 7, 9, 10 and 11) to give concrete examples on the indices proposed for shortest path and distance queries. We have also added more descriptions to introduce the fgures.
• We have also added or polished many details, e.g., the titles of fgures, the organization of each section and the presentation of algorithms. We hope that the paper is now easier to follow.
摘要
•We have rewritten Section 1 (Introduction), Section 2 (Previous and Related Work), and Section 3.1 (System Model and Assumptions) to address Comment 1 and 2 of Area Editor, Comment 9, 10 and 11 of Reviewer 1, and Comment 1 of Reviewer 2, etc.•We have added fve new fgures (Figures 5, 7, 9, 10 and 11) to give concrete examples on the indices proposed for shortest path and distance queries. We have also added more descriptions to introduce the fgures.•We have also added or polished many details, e.g., the titles of fgures, the organization of each section and the presentation of algorithms. We hope that the paper is now easier to follow.
论文关键词：Wireless data broadcast,Shortest path query,Shortest distance query,Contraction hierarchy
论文评审过程：Received 17 November 2014, Revised 15 September 2015, Accepted 26 August 2017, Available online 30 August 2017, Version of Record 1 September 2017.
论文官网地址：https://doi.org/10.1016/j.is.2017.08.009
