On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering ProblemSounaka Mishra and Kripasindhu SikdarRAIRO-Theor. Inf. Appl., 35 3 (2001) 287-309DOI: https://doi.org/10.1051/ita:2001121
