Analysis of parallel asynchronous schemes for the auction shortest path algorithm
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991. === Includes bibliographical references (leaves 114-115). === by Lazoros Polymenakos. === M.S.
Main Author: | Polymenakos, Lazaros |
---|---|
Other Authors: | Dimitri P. Bersekas. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/13285 |
Similar Items
An efficient parallel algorithm for planarity
by: Klein, Philip N. (Philip Nathan)
Published: (2006)
by: Klein, Philip N. (Philip Nathan)
Published: (2006)
Similar Items
-
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014) -
Stochastic and shortest path games : theory and algorithms
by: Patek, Stephen D. (Stephen David)
Published: (2005) -
Continuous-time dynamics shortest path algorithms
by: Dean, Brian C. (Brian Christopher), 1975-
Published: (2013) -
[Episilon]-relaxation and auction algorithms for the convex cost network flow problem
by: Plymenakos, Lazaros C. (Lazaros Christos)
Published: (2007) -
The value of information in shortest path optimization/
by: Rinehart, Michael David
Published: (2010)