| dc.contributor | Polymenakos, Lazaros. | en_US |
| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.contributor | Tsitsiklis, John N. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:41:30Z | |
| dc.date.available | 2003-04-29T15:41:30Z | |
| dc.date.issued | 1995 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3404 | |
| dc.description | Caption title. | en_US |
| dc.description | Includes bibliographical references (p. 11-12). | en_US |
| dc.description.sponsorship | Supported by the NSF. 9300494-DMI Supported by the AFO. DAAL03-92-G-0115 | en_US |
| dc.description.statementofresponsibility | L.C. Polymenakos, D.P. Bertsekas, J.N. Tsitsiklis. | en_US |
| dc.format.extent | 13 p. | en_US |
| dc.format.extent | 1095266 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 ; 2292 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.2292 | en_US |
| dc.title | Efficient algorithms for continuous-space shortest path problems | en_US |
