Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/3636
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mishra, Sounaka | - |
dc.date.accessioned | 2012-05-01T14:34:24Z | - |
dc.date.available | 2012-05-01T14:34:24Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | 152p | en_US |
dc.identifier.uri | http://hdl.handle.net/10263/3636 | - |
dc.description | This thesis is under the supervision of prof.Kripasindhu Sikdar | en_US |
dc.language.iso | en | en_US |
dc.publisher | Indian Statistical Institute,Calcutta | en_US |
dc.relation.ispartofseries | ISI Phd thesis;TH118 | - |
dc.subject | Approximability | en_US |
dc.subject | Linear ordering | en_US |
dc.subject | Np-hard optimization | en_US |
dc.subject | Np completness | en_US |
dc.title | On the approximability of linear ordering and related NP-optimization problems | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Theses |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.