Back to results

Massachusetts Institute of Technology

Analysis of parallel asynchronous schemes for the auction shortest path algorithm

Abstract

dc:description

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
1991

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Polymenakos, Lazaros
Advisor dc:contributor.advisor
  • Dimitri P. Bersekas.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • 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.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/13285
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/13285

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Polymenakos, Lazaros. Analysis of parallel asynchronous schemes for the auction shortest path algorithm. Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13285