Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks
Abstract In the real world, road networks with weight and label on edges can be applied in several application domains. The shortest path query with label restrictions has been receiving increasing attention recently. To efficiently answer such kind of queries, a novel index, namely Contraction Hier...
Main Authors: | Zi Chen, Bo Feng, Long Yuan, Xuemin Lin, Liping Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2023-09-01
|
Series: | Data Science and Engineering |
Subjects: | |
Online Access: | https://doi.org/10.1007/s41019-023-00227-6 |
Similar Items
-
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema
by: Tobias Rupp, et al.
Published: (2021-05-01) -
Planning Forest Road Alignment Using a Shortest Path Algorithm and Geographic Information System
by: Pejman Imani, et al.
Published: (2012-09-01) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Evaluation of Shortest Paths in Road Network
by: Farrukh Shehzad, et al.
Published: (2009-06-01) -
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
by: Ben Strasser, et al.
Published: (2021-03-01)