Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/3636
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMishra, Sounaka-
dc.date.accessioned2012-05-01T14:34:24Z-
dc.date.available2012-05-01T14:34:24Z-
dc.date.issued2002-
dc.identifier.citation152pen_US
dc.identifier.urihttp://hdl.handle.net/10263/3636-
dc.descriptionThis thesis is under the supervision of prof.Kripasindhu Sikdaren_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute,Calcuttaen_US
dc.relation.ispartofseriesISI Phd thesis;TH118-
dc.subjectApproximabilityen_US
dc.subjectLinear orderingen_US
dc.subjectNp-hard optimizationen_US
dc.subjectNp completnessen_US
dc.titleOn the approximability of linear ordering and related NP-optimization problemsen_US
dc.typeThesisen_US
Appears in Collections:Theses

Files in This Item:
File Description SizeFormat 
TH118.pdf11.49 MBAdobe PDFView/Open


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