A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:24, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations |
scientific article |
Statements
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (English)
0 references
10 July 2008
0 references
