TY  - JOUR
AU  - Mishra, Sounaka
AU  - Sikdar, Kripasindhu
TI  - On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2001
SP  - 287
EP  - 309
VL  - 35
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_2001__35_3_287_0/
LA  - en
ID  - ITA_2001__35_3_287_0
ER  -