Heuristic search for one-to-many shortest path queries

R Stern, M Goldenberg, A Saffidine, A Felner - Annals of Mathematics and …, 2021 - Springer
In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the
problem of solving k shortest path problems that share the same start node. This problem …
被引用次数：4 相关文章

Heuristic search for one-to-many shortest path queries

R Stern, M Goldenberg, A Saffidine… - Annals of Mathematics and …, 2021 - dl.acm.org
In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the
problem of solving k shortest path problems that share the same start node. This problem …

Heuristic search for one-to-many shortest path queries

R Stern, M Goldenberg, A Saffidine… - Annals of Mathematics …, 2021 - cris.bgu.ac.il
In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the
problem of solving k shortest path problems that share the same start node. This problem …

Heuristic search for one-to-many shortest path queries

R Stern, M Goldenberg, A Saffidine… - Annals of Mathematics …, 2021 - search.proquest.com
In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the
problem of solving k shortest path problems that share the same start node. This problem …