Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Anthony Labarre (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: