A simple and fast label correcting algorithm for shortest paths

A simple and fast label correcting algorithm for shortest paths

Includes bibliographical references (p. 11-14).

Bibliographic Details
Other Authors:	Bertsekas, Dimitri P.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Subjects:	TK7855.M41 E3845 no.2098
Online Access:	http://hdl.handle.net/1721.1/3256

Similar Items

Parallel asynchronous label correcting methods for shortest paths
Published: (2003)

An auction algorithm for shortest paths
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)

Forward path search : a new dual coordinate ascent algorithm for shortest paths
Published: (2003)

An analysis of stochastic shortest path problems
Published: (2003)

Stochastic shortest path problems with recourse
Published: (2003)

An auction/sequential shortest path algorithm for the minimum cost network flow problem
Published: (2003)

Asymptotic optimality of shortest path routing
Published: (2003)

Stochastic shortest path games : theory and algorithms
by: Patek, Stephen D. (Stephen David)
Published: (2005)

A distributed shortest path protocol
Published: (2002)

A very simple polynomial-time algorithm for linear programming
Published: (2003)

A simple bisection algorithm for the L2 induced norm of a sample-data system
Published: (2003)

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions
Published: (2003)

A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)

Proof of correctness of proposed ATM retransmission scheme
Published: (2003)

Explicit solutions for some simple decentralized detection problems
Published: (2003)

Generic rank-one corrections for value iteration : in Markovian decision problems
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2004)

Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.
Published: (2003)

A fast multiscale tomographic reconstruction method from complete but possibly noisy projection data
Published: (2003)

A new parallel smoothing algorithm
Published: (2003)

A decomposition algorithm for convex differentiable minimization
Published: (2003)

A diagnostics algorithm for impact printer actuator
Published: (2003)

A geometric projection-space reconstruction algorithm
Published: (2003)

A hierarchicial algorithm for neural training and control
Published: (2003)

A hierarchical algorithm for limited-angle reconstruction
Published: (2003)

A new algorithm for multiplication in finite fields
Published: (2003)

Topology broadcast algorithms
Published: (2003)

Parallel and distributed iterative algorithms : a selective survey
Published: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

The auction algorithm for the transportation problem
Published: (2003)

On the convergence of the affine-scaling algorithm
Published: (2003)