Heuristic search for one-to-many shortest path queries (Q825009): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10472-021-09775-x
+Normal rank
@@ Property / OpenAlex ID @@
+W3212530569
@@ Property / OpenAlex ID: W3212530569 / rank @@
+Normal rank
@@ Property / cites work @@
+Tie-Breaking Strategies for Cost-Optimal Best First Search
+Normal rank
@@ Property / cites work @@
+Generalized best-first search strategies and the optimality of A*
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Inconsistent heuristics in theory and practice
@@ Property / cites work: Inconsistent heuristics in theory and practice / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for the M Best Solutions in Graphical Models
+Normal rank
@@ Property / cites work @@
+Q2921666
@@ Property / cites work: Q2921666 / rank @@
+Normal rank
@@ Property / cites work @@
+The compressed differential heuristic
@@ Property / cites work: The compressed differential heuristic / rank @@
+Normal rank
@@ Property / cites work @@
+Enhanced Partial Expansion A*
@@ Property / cites work: Enhanced Partial Expansion A* / rank @@
+Normal rank
@@ Property / cites work @@
+MM: a bidirectional search algorithm that is guaranteed to meet in the middle
+Normal rank
@@ Property / cites work @@
+Lifelong planning \(\text{A}^*\)
@@ Property / cites work: Lifelong planning \(\text{A}^*\) / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of admissible search algorithms
@@ Property / cites work: On the complexity of admissible search algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—The <i>k</i>th Best Route Through a Network
+Normal rank
@@ Property / cites work @@
+Disjoint paths in a network
@@ Property / cites work: Disjoint paths in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Breadth-first heuristic search
@@ Property / cites work: Breadth-first heuristic search / rank @@
+Normal rank