Approximability of hard combinatorial optimization problems: an introduction (Q1593534)
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 1554229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of hard combinatorial optimization problems: an introduction |
scientific article; zbMATH DE number 1554229 |
Statements
Approximability of hard combinatorial optimization problems: an introduction (English)
0 references
17 January 2001
0 references
Most combinatorial optimization problems are NP-complete, and therefore in practice approximating methods are impotent. In this introductory survey the authors follow a historical path up to more recent developments in the theoretical characterization of approximation classes. The reader must be familiar with the main concepts of NP-completeness.
0 references
combinatorial optimization problems
0 references
introductory survey
0 references
characterization of approximation classes
0 references
NP-completeness
0 references
0.8574222326278687
0 references
0.8391240835189819
0 references
