Results 1 - 10 of 71,819

On dynamic shortest paths problems

by Liam Roditty, et al. , 2004
"... 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 ..."
Abstract - Cited by 41 (2 self) - Add to MetaCart
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

ON SOLVING DYNAMIC SHORTEST PATH PROBLEMS

by Ebrahim Nasrabadi, S. Mehdi Hashemi - EUROPT-2008, 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

by Ismail Chabini, Sridevi Ganugapati - 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 faster-than-real-time 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 faster-than-real-time 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

by Ismail Chabini - 234 I. Chabini. Minimum expected travel times in stochastic time-dependent networks revisited. Internal Report. MIT , 1999
"... A solution is provided for what appears to be a 30-year-old problem dealing with the discovery of the most efficient algorithms possible to compute all-to-one 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 78 (2 self) - Add to MetaCart
A solution is provided for what appears to be a 30-year-old problem dealing with the discovery of the most efficient algorithms possible to compute all-to-one shortest paths in discrete dynamic networks. This problem lies at the heart of efficient solution approaches to dynamic network models

Genetic Algorithms with Elitism-based Immigrants for Dynamic Shortest Path Problem in Mobile Ad Hoc Networks

by Hui Cheng, Shengxiang Yang Member
"... 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

Incremental Shortest-Path Problem

by G. Ramalingam, Thomas Reps, G. Ramalingam
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract - Add to MetaCart
incremental algorithm for the single-source shortest-path problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortest-path problem is its ability to handle “multiple heterogeneous modifications”: between updates, the input graph is allowed

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

by G. Ramalingam, Thomas Reps , 1992
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract - Cited by 139 (1 self) - Add to MetaCart
incremental algorithm for the single-source shortest-path problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortest-path problem is its ability to handle "multiple heterogeneous modifications": between updates, the input graph is allowed

Continuous-Time Dynamic Shortest Path Algorithms

by Brian C. Dean , 1999
"... We consider the problem of computing shortest paths through a dynamic network – a network with time-varying 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 time-varying 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

Finding the k Shortest Paths

by David Eppstein , 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.

Dynamic Shortest Path Algorithms for Hypergraphs

by Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-noy
"... A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path prob ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first addressing the fully dynamic shortest path problem in a general hypergraph. They complement each other
Results 1 - 10 of 71,819