On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901)
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 existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems |
scientific article; zbMATH DE number 6362568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems |
scientific article; zbMATH DE number 6362568 |
Statements
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (English)
0 references
30 October 2014
0 references
reoptimization
0 references
\(r\)-approximation algorithm
0 references
polynomial-time approximation scheme
0 references
0.94747835
0 references
0 references
0.89672804
0 references
0.89487886
0 references
0.8915218
0 references
0.8769524
0 references
0.87409997
0 references
0.8712891
0 references
0.8708674
0 references
