Results 1 to 10 of about 735,367 (300)

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, Euler, Ricardo   +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, B Bollobás, KM Borgwardt, M Liśkiewicz, S Havlin, S Shalev-Shwartz, T Gärtner   +6 more
arxiv   +3 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, DP Dobkin, DZ Chen, DZ Chen, DZ Chen, EA Melissaratos, H Rohnert, J Hershberger, JA Storer, JSB Mitchell, Pankaj K. Agarwal, R Bar-Yehuda, R Inkulu, S Kapoor, S Kapoor, SK Ghosh, SK Ghosh   +16 more
arxiv   +3 more sources

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, Xi Lu, Xiaoge Zhang, Qing Wang, Yong Deng   +4 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

When the path is never shortest: a reality check on shortest path biocomputation [PDF]

, 2017
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route optimisation and labyrinth navigation, but their outputs are typically difficult to reproduce and ...
A Adamatzky, A Adamatzky, A Adamatzky, A. Tero, Andrew Adamatzky, C Scherber, CD Harvey, CR Reid, IH Riedel-Kruse, J Baumgardner, J Houten Van, J Houten Van, J Jones, Jeff Jones, K Ramsch, K Vittori, L Zhu, M Dorigo, M Vela-Pérez, Michael Esau, R Mayne, R Mayne, R Mayne, Richard Mayne, S Stepney, Saikat Jana, SC Pratt, T Hennessey, T Nakagaki   +28 more
arxiv   +3 more sources

A novel discrete zeroing neural network for online solving time-varying nonlinear optimization problems [PDF]

Frontiers in Neurorobotics
To 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, Yanpeng Zhou, Changxian Xu, Zhongbo Sun   +3 more
doaj   +2 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   +2 more sources

A simpler and more efficient algorithm for the next-to-shortest path problem [PDF]

, 2011
Given an undirected graph $G=(V,E)$ with positive edge lengths and two vertices $s$ and $t$, the next-to-shortest path problem is to find an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length.
Bang Ye Wu, I. Krasiko, K.-H. Kao, K.N. Lalgudi, M. Thorup, M.L. Fredman, M.R. Henzinger, S. Alstrup, S. Li, S. Mondal, S.C. Barman, T.H. Cormen   +11 more
core   +2 more sources

An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem

IEEE Access, 2021
The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we ...
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina   +2 more
doaj   +1 more source