| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:35:43Z | |
| dc.date.available | 2003-04-29T15:35:43Z | |
| dc.date.issued | 1990 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3222 | |
| dc.description | Caption title. | en_US |
| dc.description | Includes bibliographical references (p. 27-29). | en_US |
| dc.description.sponsorship | Research supported by the ARO. DAAL03-86-K-0171 Research supported by the NSF. DDM-8903385 | en_US |
| dc.description.statementofresponsibility | by Dimitri P. Bertsekas. | en_US |
| dc.format.extent | 29 p. | en_US |
| dc.format.extent | 2216928 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems | en_US |
| dc.relation.ispartofseries | LIDS-P ; 2000 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.2000 | en_US |
| dc.title | An auction algorithm for shortest paths | en_US |
