Approximation algorithms for sorting by bounded singleton moves (Q2143142)
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: Approximation algorithms for sorting by bounded singleton moves |
scientific article; zbMATH DE number 7533877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for sorting by bounded singleton moves |
scientific article; zbMATH DE number 7533877 |
Statements
Approximation algorithms for sorting by bounded singleton moves (English)
0 references
31 May 2022
0 references
bounded singleton move
0 references
permutation
0 references
approximation algorithm
0 references
0.9870082139968872
0 references
0.870160698890686
0 references
0.8591841459274292
0 references
0.8566644191741943
0 references
0.8527873754501343
0 references
