A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves

DOI10.1016/j.tcs.2012.03.019zbMath1245.68145OpenAlexW1973005012MaRDI QIDQ441865

Haitao Jiang, Binhai Zhu, Daming Zhu

Publication date: 8 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.019

zbMATH Keywords

approximation algorithmpermutationshort block-move

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Related Items (3)

Approximation algorithms for sorting permutations by length-weighted short rearrangements ⋮ Length-weighted \(\lambda\)-rearrangement distance ⋮ Sorting a permutation by best short swaps

Cites Work

• Sorting by bounded block-moves
• Sorting by short block-moves
• On sorting by 3-bounded transpositions
• Sorting by Transpositions Is Difficult
• Sorting by Transpositions
• Sorting a bridge hand

This page was built for publication: A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves