Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
复制标题
DOI：
10.1007/s10589-006-0394-6
复制
发表时间：
2007
影响因子：
2.2
通讯作者：
Xiaoguang Yang;Jianzhon Zhang
中科院分区：
文献类型：
--
作者：
Xiaoguang Yang;Jianzhon Zhang
在本文中，我们考虑两种类型的逆排序问题。第一种类型是一个逆排序问题，通过最大限度地减少总加权数的变化与约束。我们提出了一个O（n ~ 2）时间的算法来解决这个问题。第二种类型是部分逆排序问题和部分逆排序问题的变体。我们表明，部分逆排序问题和变体可以解决的排序问题和逆排序问题的组合。
In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem by minimizing the total weighted number of changes with bound constraints. We present anO(n2) time algorithm to solve the problem. The second type is a partial inverse sorting problem and a variant of the partial inverse sorting problem. We show that both the partial inverse sorting problem and the variant can be solved by a combination of a sorting problem and an inverse sorting problem.