Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2862
Full metadata record
DC FieldValueLanguage
dc.contributorGafni, Eli M.-
dc.contributorBertsekas, Dimitri P.-
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.-
dc.date2003-04-29T15:22:43Z-
dc.date2003-04-29T15:22:43Z-
dc.date1983-
dc.date.accessioned2013-06-04T16:15:33Z-
dc.date.available2013-06-04T16:15:33Z-
dc.date.issued2013-06-05-
dc.identifierhttp://hdl.handle.net/1721.1/2862-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionEli M. Gafni, Dimitri P. Bertsekas.-
dc.description"July 1983"-
dc.descriptionBibliography: p. 29-30.-
dc.description"DARPA ... contract ONR/N00014-75-C-1183"-
dc.format30 p.-
dc.format1281956 bytes-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherLaboratory for Information and Decision Systems, Massachusetts Institute of Technology-
dc.relationLIDS-P ; 1307-
dc.subjectTK7855.M41 E3845 no.1307-
dc.subjectComputer networks-
dc.titleAsymptotic optimality of shortest path routing-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.