On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem |
scientific article |
Statements
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (English)
0 references
20 February 2002
0 references
minimum linear ordering problem
0 references
NP-optimization problems
0 references
0 references
