Download citation

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

RAIRO-Theor. Inf. Appl., 35 3 (2001) 287-309
DOI: https://doi.org/10.1051/ita:2001121