A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344)
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: A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations |
scientific article; zbMATH DE number 5299260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations |
scientific article; zbMATH DE number 5299260 |
Statements
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (English)
0 references
10 July 2008
0 references
0.9770540595054626
0 references
0.8164575099945068
0 references
0.8140711188316345
0 references
0.8115729689598083
0 references
0.8112326264381409
0 references
