Results 1 to 10 of about 990,734 (388)
A Bio-Inspired Method for the Constrained Shortest Path Problem [PDF]
The Scientific World Journal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang +4 more
doaj +3 more sources
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +5 more sources
Neutrosophic Shortest Path Problem [PDF]
Neutrosophic Sets and Systems, 2018 Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to ...
Ranjan Kumar +4 more
doaj +2 more sources
Labeling Methods for Partially Ordered Paths [PDF]
European Journal of Operational Research, Volume 318, Issue 1, 1
October 2024, Pages 19-30, 2023 The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new challenges as the models and assessing the optimality of paths become more complicated.
Casas, Pedro Maristany de las +1 more
arxiv +3 more sources
Generalized Shortest Path Kernel on Graphs [PDF]
arXiv, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification problem, we consider the task of classifying random graphs from two well-known families, by the number of clusters ...
A Fronczak +6 more
arxiv +3 more sources
A lower bound for the shortest path problem [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2002 AbstractWe show that the shortest path problem cannot be solved in o(logn) time on an unbounded fan-in PRAM without bit operations using poly(n) processors, even when the bit-lengths of the weights on the edges are restricted to be of size O(log3n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in
K. Mulmuley, P. Shah
openalex +4 more sources
Computing a rectilinear shortest path amid splinegons in plane [PDF]
arXiv, 2017 We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define a polygonal domain \calP from \calS and transform a rectilinear shortest path computed in \calP to ...
DP Dobkin +16 more
arxiv +3 more sources
Shortest Path Problems on a Polyhedral Surface [PDF]
Algorithmica, 2009 We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance. Our main result is a linear-factor speedup for computing all shortest path edge sequences on
Atlas F. Cook, Carola Wenk
openalex +6 more sources
A novel discrete zeroing neural network for online solving time-varying nonlinear optimization problems [PDF]
Frontiers in NeuroroboticsTo reduce transportation time, a discrete zeroing neural network (DZNN) method is proposed to solve the shortest path planning problem with a single starting point and a single target point.
Feifan Song +3 more
doaj +2 more sources
Rerouting shortest paths in planar graphs [PDF]
arXiv, 2012 A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists from P to Q. This problem is PSPACE-hard in general, but we show that it can be solved in polynomial
Bonsma, Paul
arxiv +6 more sources