Results 11 to 20 of about 190,109 (292)
Near-shortest and K-shortest simple paths [PDF]
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 +5 more sources
Multiple Object Tracking Using K-Shortest Paths Optimization [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011 Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previous and following ones, a correct trajectory will nevertheless be produced.
Berclaz Jerome +3 more
openaire +2 more sources
Finding k-shortest paths with limited overlap [PDF]
The VLDB Journal, 2020 AbstractIn this paper, we investigate the computation of alternative paths between two locations in a road network. More specifically, we study the k-shortest paths with limited overlap ($$k\text {SPwLO}$$ k SPwLO ) problem that aims at finding a set of k ...
Theodoros Chondrogiannis +4 more
openaire +4 more sources
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +2 more sources
A genetic algorithm for finding the k shortest paths in a network
Egyptian Informatics Journal, 2010 Most of the multimedia applications require the k shortest paths during the communication between a single source and multiple destinations. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The paper proposes a
Ahmed Younes Hamed
doaj +1 more source
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
Моделирование и анализ информационных систем, 2023 In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)
Alexander Valeryevich Smirnov
doaj +1 more source
Efficiently listing bounded length st-paths [PDF]
, 2014 The problem of listing the $K$ shortest simple (loopless) $st$-paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with $n$ vertices and $m$ edges, the most efficient solution is an $O(K(mn + n^2 \log n ...
Rizzi, Romeo +2 more
core +2 more sources
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
International Journal of Transportation Science and Technology, 2015 Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing
Xianbiao Hu, PhD, Yi-Chang Chiu
doaj +1 more source
Driver Route Planning Method Based on Accident Risk Cost Prediction
Journal of Advanced Transportation, 2022 The number of cars on roadways around the world continues to increase year over year. However, the imbalance between traffic supply and demand has not only brought traffic congestion but also caused serious safety problems.
Xiaoleng Liao +5 more
doaj +1 more source
Algorithm for finding subcritical paths on network diagrams
Российский технологический журнал, 2023 Objectives. Network diagrams are used as an information support element in planning and project management processes for structuring planned work and calculating project efficiency characteristics.
M. A. Аnfyorov
doaj +1 more source