Sorting by prefix block-interchanges - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

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, show how to obtain improved lower and upper bounds on the corresponding distance, and determine the largest possible value for that distance.
Fichier principal
Vignette du fichier
LIPIcs-ISAAC-2020-55.pdf (540.38 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-02926790 , version 1 (02-02-2024)

Identifiants

Citer

Anthony Labarre. Sorting by prefix block-interchanges. ISAAC 2020, Dec 2020, Hong-Kong, China. pp.55:1-55:15, ⟨10.4230/LIPIcs.ISAAC.2020.55⟩. ⟨hal-02926790⟩
71 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More