The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time

DOI10.1007/978-3-642-11440-3_15zbMath1274.68686OpenAlexW2083245516MaRDI QIDQ3404440

Masud Hasan, Ashik Z. Khan, Jesun S. Firoz, M. Sohel Rahman

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_15

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Approximation algorithms (68W25)

Related Items (1)

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

This page was built for publication: The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time