Show simple item record

dc.contributor.advisorJohn M. Wozencraft.en_US
dc.contributor.authorRos Perán, Francisco de Asisen_US
dc.date.accessioned2005-08-04T15:49:53Z
dc.date.available2005-08-04T15:49:53Z
dc.date.issued1979en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/16020
dc.descriptionThesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.en_US
dc.descriptionMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.en_US
dc.descriptionVita.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.statementofresponsibilityby Francisco de Asís Ros Peran.en_US
dc.format.extent329 leavesen_US
dc.format.extent16444745 bytes
dc.format.extent16444500 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Scienceen_US
dc.subject.lcshComputer networksen_US
dc.subject.lcshAlgorithmsen_US
dc.subject.lcshLinear programmingen_US
dc.subject.lcshInformation theoryen_US
dc.titleRouting to minimize the maximum congestion in a communication networken_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc07201156en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record