Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks
Summary: Introduces Border-based State Move (BSM), an index-driven LCSP solver for labeled road graphs using border-vertex skipping to prune exploration. Shows two orders of magnitude speedup vs top LCSP methods and supports flexible language constraints.
(summarized by gpt-5-nano on Feb 09 2026)
@inproceedings{wang_sigmod25,
title = {{Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks}},
author = {Wang, Libin and Wong, Raymond Chi-Wing},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725402},
url = {https://dl.acm.org/doi/10.1145/3725402},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
PreviousPage 1 / 1Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.