Approximation algorithms for sorting by bounded singleton moves

DOI10.1016/j.tcs.2022.03.011OpenAlexW4221056238MaRDI QIDQ2143142

Haitao Jiang, Daming Zhu, Shengjun Xie, Haodi Feng

Publication date: 31 May 2022

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

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

zbMATH Keywords

approximation algorithmpermutationbounded singleton move

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A 14/11-approximation algorithm for sorting by short block-moves
• Sorting by bounded block-moves
• Sorting by short block-moves
• On sorting by 3-bounded transpositions
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• Sorting by Transpositions Is Difficult
• Faster algorithms for sorting by transpositions and sorting by block interchanges
• Sorting by Transpositions
• Sorting a bridge hand
• Unnamed Item

This page was built for publication: Approximation algorithms for sorting by bounded singleton moves