Sorting by Prefix Block-Interchanges

08/31/2020
by   Anthony Labarre, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset