2013
DOI: 10.1007/978-3-319-03578-9_24
|View full text |Cite
|
Sign up to set email alerts
|

Dynamically Maintaining Shortest Path Trees under Batches of Updates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
2
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…Hence, the algorithms we proposed in this work may benefit from any advances made for dynamic shortest path algorithms. For example, recently D'Andrea et al [38] presented an algorithm that allows for dynamically maintaining shortest path trees under batches of updates which can be used by LBT-RRT instead of the SSSP algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…Hence, the algorithms we proposed in this work may benefit from any advances made for dynamic shortest path algorithms. For example, recently D'Andrea et al [38] presented an algorithm that allows for dynamically maintaining shortest path trees under batches of updates which can be used by LBT-RRT instead of the SSSP algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…For example, recently D'Andrea et al [38] presented an algorithm that allows for dynamically maintaining shortest path trees under batches of updates which can be used by LBT-RRT instead of the SSSP algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…It is imperative to design dynamic algorithms that can efficiently update distance labelling to reflect graph changes for fast and accurate response to distance queries. So far, only limited attempts have been made on maintaining a distance labelling for dynamic graphs [8,10,[24][25][26]. Among them, the methods considering incremental updates (i.e.…”
Section: Introductionmentioning
confidence: 99%