Results 1 - 10 of 23,617

The Stable Paths Problem and Interdomain Routing

by Timothy G. Griffin, F. Bruce Shepherd, Gordon Wilfong - IEEE/ACM Transactions on Networking , 2002
"... Abstract—Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the shortest paths problem. The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does not solve a shortest paths problem sinc ..."
Abstract - Cited by 262 (11 self) - Add to MetaCart
Abstract—Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the shortest paths problem. The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does not solve a shortest paths problem

Approximation Algorithms for Disjoint Paths Problems

by Jon Michael Kleinberg , 1996
"... The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NP-complete problems for w ..."
Abstract - Cited by 166 (0 self) - Add to MetaCart
The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NP-complete problems

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

The Optimal Path Problem

by Ernesto de Queirós Vieira Martins, Marta Margarida Braz Pascoal, Deolinda Maria Lopes Dias Rasteiro, José Luis Esteves dos Santos , 1999
"... In this paper, the optimal path problem will be studied from a global point of view and having no restrictions imposed on the network. The concepts of boundness and finiteness will be presented for the general problem and will be studied in two particular cases. Special emphasis will be given to t ..."
Abstract - Cited by 58 (3 self) - Add to MetaCart
In this paper, the optimal path problem will be studied from a global point of view and having no restrictions imposed on the network. The concepts of boundness and finiteness will be presented for the general problem and will be studied in two particular cases. Special emphasis will be given

Molecular Computation Of Solutions To Combinatorial Problems

by Leonard M. Adleman , 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract - Cited by 773 (6 self) - Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility

Path Problems in Graphs

by Günter Rote - COMPUTING SUPPL , 1989
"... A large variety of problems in computer science can be viewed from a common viewpoint as instances of "algebraic" path problems. Among them are of course path problems in graphs such as the shortest path problem or problems of finding optimal paths with respect to more generally defined ..."
Abstract - Cited by 31 (0 self) - Add to MetaCart
A large variety of problems in computer science can be viewed from a common viewpoint as instances of "algebraic" path problems. Among them are of course path problems in graphs such as the shortest path problem or problems of finding optimal paths with respect to more generally

On the Bottleneck Shortest Path Problem

by Volker Kaibel, Matthias A. F. Peinhardt , 2006
"... The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we

Faster algorithms for the shortest path problem

by Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan , 1990
"... Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, mn edges, and nonnegative integer arc costs bounded by C, a one-level form of radix heap gives a t ..."
Abstract - Cited by 135 (12 self) - Add to MetaCart
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, mn edges, and nonnegative integer arc costs bounded by C, a one-level form of radix heap gives a

The Generalized Shortest Path Problem

by Vladimir Batagelj, Franz J. Brandenburg, Patrice Ossona De Mendez, Arunabha Sen
"... this paper we show that the generalized shortest path problem can be solved efficiently for multiplicative weights. The solution is running Dijkstra's algorithm in reverse. In the case of additive weights there is a dynamic programming approach and a pseudo-polynomial algorithm. Finally, if the ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
this paper we show that the generalized shortest path problem can be solved efficiently for multiplicative weights. The solution is running Dijkstra's algorithm in reverse. In the case of additive weights there is a dynamic programming approach and a pseudo-polynomial algorithm. Finally

Robust shortest path problems

by Virginie Gabrel, Cécile Murat
"... This paper is a state of the art on the shortest path problems for which it ex-ists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are ..."
Abstract - Add to MetaCart
This paper is a state of the art on the shortest path problems for which it ex-ists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness
Results 1 - 10 of 23,617