The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time (Q3404440)
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: The 1.375 approximation algorithm for sorting by transpositions can run in O(n n) time |
scientific article; zbMATH DE number 5667863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time |
scientific article; zbMATH DE number 5667863 |
Statements
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time (English)
0 references
9 February 2010
0 references
0.8817129135131836
0 references
0.8807597160339355
0 references
0.8554969429969788
0 references
0.8266386985778809
0 references
0.8254556059837341
0 references
