On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183)
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 approximability of linear ordering and related NP-optimization problems on graphs. |
scientific article; zbMATH DE number 2055508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximability of linear ordering and related NP-optimization problems on graphs. |
scientific article; zbMATH DE number 2055508 |
Statements
On approximability of linear ordering and related NP-optimization problems on graphs. (English)
0 references
14 March 2004
0 references
Linear ordering problem
0 references
Feedback set problem
0 references
Parametrized triangle inequality
0 references
NPO problem
0 references
APX-completeness
0 references
Approximation algorithm
0 references
Linear ordering polytope
0 references
LP-relaxation
0 references
0 references
0 references
0 references
0 references
