Results 11 to 20 of about 1,116,280 (113)
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +4 more sources
J. Comput. Geom., 2023 Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric.
Löffler, M. +3 more
openaire +9 more sources
The College Mathematics Journal, 2021 35 pages, including 3 appendices and program ...
Richard Goldstone +2 more
openaire +2 more sources
Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path [PDF]
, 2021 The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur +2 more
core +1 more source
Shortest Paths between Shortest Paths and Independent Sets [PDF]
, 2011 We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length.
Kaminski, Marcin +2 more
openaire +4 more sources
The Resource constrained shortest path problem implemented in a lazy functional language [PDF]
, 1996 The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language.
Hartel, Pieter H., Glaser, Hugh
core +4 more sources
Shortest paths between shortest paths
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Kaminski 0001 +2 more
openaire +3 more sources
AbcAeffchen/k-shortest-path: 1.0.0
, 2023 Implementations of k-shortest-path algorithms used in some research ...
Alex Schickedanz
core +1 more source
Shortest paths with ordinal weights [PDF]
European Journal of Operational Research, 2020 24 pages, 8 figures, 2 ...
Luca E. Schäfer +4 more
openaire +4 more sources
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Darmann +2 more
openaire +2 more sources