Efficient navigation for constrained shortest path with adaptive expansion control
In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large gra...
Saved in:
Main Authors: | XIA, Wenwen, LI, Yuchen, GUO, Wentian, LI, Shenghong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7782 https://ink.library.smu.edu.sg/context/sis_research/article/8785/viewcontent/EfficientNavi_CSP_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Multicast routing in WDM networks
by: LAHLOU KITANE DRISS
Published: (2010) -
Shortest Path Computation on Air Indexes
by: KELLARIS, Georgios, et al.
Published: (2010) -
Shortest Path Computation with No Information Leakage
by: MOURATIDIS, Kyriakos, et al.
Published: (2012) -
CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
by: Lin, Deyu, et al.
Published: (2023)