The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (Q3404440)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time |
scientific article |
Statements
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (English)
0 references
9 February 2010
0 references
