Results 11 to 20 of about 23,111 (264)
On Dynamic Shortest Paths Problems [PDF]
Algorithmica, 2004 From the authors' abstract: ``We obtain the following results related to dynamic versions of the shortest-paths problem:'' (i) ``Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths ...
Liam Roditty, Uri Zwick
openaire +2 more sources
A lower bound for the shortest path problem [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MULMULEY, K, SHAH, P
openaire +2 more sources
On the Quadratic Shortest Path Problem [PDF]
, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
openaire +3 more sources
On Solving the Quadratic Shortest Path Problem [PDF]
INFORMS Journal on Computing, 2019 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order $m+1$, where $m$ is the number of arcs in the ...
Hao Hu, Renata Sotirov
openaire +4 more sources
An Analysis of Stochastic Shortest Path Problems [PDF]
Mathematics of Operations Research, 1991 We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative.
Dimitri P. Bertsekas, John N. Tsitsiklis
openaire +1 more source
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The shortest path problem has been studied to be solved through diverse deterministic and also stochastic approaches such as Ant Colony Optimization. One of the most challenging issues with the implication of Ant Colony Optimization to solve the shortest
N. Zarrinpanjeh +5 more
doaj +1 more source
A spectral approach to the shortest path problem [PDF]
Linear Algebra and its Applications, 2021 Let $G=(V,E)$ be a simple, connected graph. One is often interested in a short path between two vertices $u,v$. We propose a spectral algorithm: construct the function $ϕ:V \rightarrow \mathbb{R}_{\geq 0}$ $$ ϕ= \arg\min_{f:V \rightarrow \mathbb{R} \atop f(u) = 0, f \not\equiv 0} \frac{\sum_{(w_1, w_2) \in E}{(f(w_1)-f(w_2))^2}}{\sum_{w \in V}{f(w)^2}}.
openaire +3 more sources
Faster algorithms for shortest path and network flow based on graph decomposition
Journal of Graph Algorithms and Applications, 2019 We propose faster algorithms for the maximum flow problem and shortest path problems based on graph decomposition. Our algorithms first construct indices (data structures) from a given graph, then use them for solving the problems.
Manas Jyoti Kashyop +2 more
doaj +1 more source
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +1 more source
Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space
Journal of Advanced Transportation, 2022 Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path
Hongtai Yang +5 more
doaj +1 more source