On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem |
scientific article; zbMATH DE number 1709146
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem |
scientific article; zbMATH DE number 1709146 |
Statements
20 February 2002
0 references
minimum linear ordering problem
0 references
NP-optimization problems
0 references
0 references
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (English)
0 references
