%0 Journal Article
%A Mishra, Sounaka
%A Sikdar, Kripasindhu
%T On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2001
%P 287-309
%V 35
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_2001__35_3_287_0/
%G en
%F ITA_2001__35_3_287_0