Please use this identifier to cite or link to this item: http://www.idr.iitkgp.ac.in/xmlui/handle/123456789/5217
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPal, Rajat Kumar-
dc.date.accessioned2015-10-13T05:39:06Z-
dc.date.available2015-10-13T05:39:06Z-
dc.date.issued1994-11-
dc.identifier.govdocNB11905-
dc.identifier.urihttp://www.idr.iitkgp.ac.in/xmlui/handle/123456789/5217-
dc.language.isoenen
dc.publisherIIT Kharagpuren
dc.subjectVertical Constraintsen
dc.subjectAbsolute Approximationen
dc.subjectNo-Dogleg Routingen
dc.subjectLower Bounden
dc.subjectNP-Hardnessen
dc.subjectWire Lengthen
dc.subjectHorizontal Constraintsen
dc.subjectMulti-Layer Channel Routingen
dc.titleOn the Computational Complexity & the Design of Algorithms for Multi-Layer Channel Routingen
dc.typeThesisen
Appears in Collections:On the Computational Complexity & the Design of Algorithms for Multi-Layer Channel Routing

Files in This Item:
File Description SizeFormat 
NB11905_Abstract.pdf126.25 kBAdobe PDFThumbnail
View/Open
NB11905_Thesis.pdf
  Restricted Access
10.61 MBAdobe PDFView/Open Request a copy


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