Results 1  10
of
872,345
On dynamic shortest paths problems
 In ESA: Annual European Symposium on Algorithms
, 2004
"... Abstract. We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
Abstract. We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard
ON SOLVING DYNAMIC SHORTEST PATH PROBLEMS
 EUROPT2008, MAY 20–23, 2008, NERINGA, LITHUANIA
, 2008
"... Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic shortest path problem is to determine a path from a specified source node to every other node with minimal total c ..."
Abstract
 Add to MetaCart
Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic shortest path problem is to determine a path from a specified source node to every other node with minimal total
Parallel algorithms for dynamic shortest path problems
 International Transactions in Operational Research
, 2002
"... The development of intelligent transportation systems (ITS) and the resulting need for the solution of a variety of dynamic traffic network models and management problems require fasterthanrealtime computation of shortest path problems in dynamic networks. Recently, a sequential algorithm was dev ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The development of intelligent transportation systems (ITS) and the resulting need for the solution of a variety of dynamic traffic network models and management problems require fasterthanrealtime computation of shortest path problems in dynamic networks. Recently, a sequential algorithm
Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
 234 I. Chabini. Minimum expected travel times in stochastic timedependent networks revisited. Internal Report. MIT
, 1999
"... A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models that a ..."
Abstract

Cited by 73 (3 self)
 Add to MetaCart
A solution is provided for what appears to be a 30yearold problem dealing with the discovery of the most efficient algorithms possible to compute alltoone shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models
Genetic Algorithms with Elitismbased Immigrants for Dynamic Shortest Path Problem in Mobile Ad Hoc Networks
"... Abstract — In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, mo ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract — In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 144 (1 self)
 Add to MetaCart
incremental algorithm for the singlesource shortestpath problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortestpath problem is its ability to handle "multiple heterogeneous modifications": between updates, the input graph is allowed
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (34 self)
 Add to MetaCart
to be shortest paths. The algorithm and its analysis are simple and intuitive, yet the algorithm runs as fast as any other known method on dense. graphs, achieving an O(n³) time bound on an nvertex graph. By incorporating the dynamic tree data structure of Sleator and Tarjan, we obtain a version
ContinuousTime Dynamic Shortest Path Algorithms
, 1999
"... We consider the problem of computing shortest paths through a dynamic network – a network with timevarying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic beha ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We consider the problem of computing shortest paths through a dynamic network – a network with timevarying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Results 1  10
of
872,345