On the approximability of linear ordering and related NP-optimization problems
No Thumbnail Available
Files
Date
2002
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Indian Statistical Institute,Calcutta
Abstract
Description
This thesis is under the supervision of prof.Kripasindhu Sikdar
Keywords
Approximability, Linear ordering, Np-hard optimization, Np completness
Citation
152p