On approximating NP-hard optimization problems (Q1126838)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1184382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating NP-hard optimization problems |
scientific article; zbMATH DE number 1184382 |
Statements
On approximating NP-hard optimization problems (English)
0 references
5 August 1998
0 references
Consider the problem of satisfying the maximal number of equations in an over-determined system of linear equations. The author shows that it is NP-hard to approximate this problem within a factor smaller than 2.
0 references
NP-hard optimization problems
0 references
approximating algorithms
0 references
linear equations
0 references
0.8092015981674194
0 references
0.7866680026054382
0 references
0.7822509407997131
0 references
