论文标题
通过前缀块 - 键入分类
Sorting by Prefix Block-Interchanges
论文作者
论文摘要
我们使用前缀块中 - 交易所进行排序排列的研究，该置换块与另一个非交流间隔交换置换的任何前缀。目的是使用尽可能少的此类操作将给定排列转换为身份置换。我们给出了此问题的2个附属算法，显示如何在相应距离上获得改进的上限和上限，并确定该距离的最大可能值。
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.
