Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079)
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 5896716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a permutation problem by a fully polynomial-time approximation scheme |
scientific article; zbMATH DE number 5896716 |
Statements
Solving a permutation problem by a fully polynomial-time approximation scheme (English)
0 references
18 May 2011
0 references
combinatorial optimization
0 references
discrete control theory
0 references
polynomial-time approximation scheme
0 references
0.89500177
0 references
0.88656723
0 references
0.8859533
0 references
0.8841926
0 references
0.88296413
0 references
0.88073915
0 references
0.8781143
0 references
0.87793535
0 references
