On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
収録刊行物
-
- RAIRO - Theoretical Informatics and Applications
-
RAIRO - Theoretical Informatics and Applications 35 (3), 287-309, 2001-05
EDP Sciences