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

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita:2001121
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences


Related search