Results 21 to 30 of about 49,625 (158)
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 +1 more source
Near-shortest and K-shortest simple paths
Networks, 2005 Summary: We present a new algorithm for enumerating all near-shortest simple (loopless) \(s\)-\(t\) paths in a graph \(G=(V,E)\) with nonnegative edge lengths. Letting \(n=|V|\) and \(m=|E|\), the time per path enumerated is \(O(nS(n,m))\) given a user-selected short-est-path subroutine with complexity \(O(S(n,m))\).
Carlyle, W. Matthew, Wood, R .Kevin
openaire +2 more sources
Shortest path poset of Bruhat intervals [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Let $[u,v]$ be a Bruhat interval and $B(u,v)$ be its corresponding Bruhat graph. The combinatorial and topological structure of the longest $u-v$ paths of $B(u,v)$ has been extensively studied and is well-known.
Saúl A. Blanco
doaj +1 more source
Engineering Science and Technology, an International Journal, 2021 Most of the previous studies on mobile robot path planning consider the obstacles as polygons. However, the complex shaped obstacles should be considered as curves rather than polygons, since the latter may result in non-optimal paths.
Neeta A. Eapen
doaj +1 more source
A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
Tehnički Glasnik, 2023 Transportation process or activity can be considered as a multi-objective problem reasonably. However, it is difficult to obtain an absolute shortest path with optimizing the multiple objectives at the same time by means of Pareto approach. In this paper,
Maosheng Zheng, Jie Yu
doaj +1 more source
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Jisuanji gongcheng, 2020 Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source
Stochastic Shortest Path Games [PDF]
SIAM Journal on Control and Optimization, 1999 Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
Reconfiguring Shortest Paths in Graphs
Algorithmica, 2022 AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Gajjar, Kshitij +3 more
openaire +3 more sources
Journal of Advanced Transportation, 2023 Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks.
Yanming Sun, Jie Li, Shixian Liu
doaj +1 more source
Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning
Journal of Marine Science and Engineering, 2023 The increase in maritime traffic and vessel size has strengthened the need for economical and safe maritime transportation networks. Currently, ship path planning is based on past experience and shortest route usage. However, the increasing complexity of
Jeong-Seok Lee +2 more
doaj +1 more source