![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
"The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ..."
Jesun Sahariar Firoz et al. (2009)
- Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time. CoRR abs/0910.3292 (2009)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.