Sorting by prefix block-interchanges - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2023

Sorting by prefix block-interchanges

Résumé

We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation using as few such operations as possible. We give a 2-approximation algorithm for this problem, as well as a 4/3-approximation for simple permutations; we prove tight lower and upper bounds on the corresponding distance; and we bound the largest value that the distance can reach.
Fichier principal
Vignette du fichier
sbpbi-isaac-journal.pdf (396.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04326879 , version 1 (02-03-2024)

Identifiants

Citer

Anthony Labarre. Sorting by prefix block-interchanges. Theoretical Computer Science, 2023, 958, pp.113857. ⟨10.1016/j.tcs.2023.113857⟩. ⟨hal-04326879⟩
31 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More