Analysis of parallel asynchronous schemes for the auction shortest path algorithm

Author(s)
Polymenakos, Lazaros
Thumbnail
DownloadFull printable version (6.255Mb)
Advisor
Dimitri P. Bersekas.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.
 
Includes bibliographical references (leaves 114-115).
 
Date issued
1991
URI
http://hdl.handle.net/1721.1/13285
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science
Collections