Show simple item record

dc.contributorPolymenakos, Lazaros.en_US
dc.contributorBertsekas, Dimitri P.en_US
dc.contributorTsitsiklis, John N.en_US
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.en_US
dc.date.accessioned2003-04-29T15:41:30Z
dc.date.available2003-04-29T15:41:30Z
dc.date.issued1995en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/3404
dc.descriptionCaption title.en_US
dc.descriptionIncludes bibliographical references (p. 11-12).en_US
dc.description.sponsorshipSupported by the NSF. 9300494-DMI Supported by the AFO. DAAL03-92-G-0115en_US
dc.description.statementofresponsibilityL.C. Polymenakos, D.P. Bertsekas, J.N. Tsitsiklis.en_US
dc.format.extent13 p.en_US
dc.format.extent1095266 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems]en_US
dc.relation.ispartofseriesLIDS-P ; 2292en_US
dc.subject.lccTK7855.M41 E3845 no.2292en_US
dc.titleEfficient algorithms for continuous-space shortest path problemsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record