Results 21 to 30 of about 391,490 (227)
The Steiner bi-objective shortest path problem
EURO Journal on Computational Optimization, 2021 In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T⊂V of terminals. Arcs are labeled with travel time and cost.
Hamza Ben Ticha +3 more
doaj +1 more source
Shortest paths between shortest paths
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaminski, Marcin +2 more
openaire +1 more source
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
Shortest‐path network interdiction
Networks, 2002 AbstractWe study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget.
Israeli, E., Wood, R.K.
openaire +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 +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
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Bang-Jensen +5 more
core +1 more source
Shortest path discovery of complex networks [PDF]
, 2008 In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model.
A. Lakhina +4 more
core +2 more sources
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
Percolating paths through random points : [PDF]
, 2005 We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process.
Aldous, David, Krikun, Maxim
core +4 more sources