Sciweavers

Share
COCOON
2005
Springer

Some New Results on Inverse Sorting Problems

9 years 7 months ago
Some New Results on Inverse Sorting Problems
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, which can be solved in O(n2 ) time. The second type is a family of partial inverse sorting problems which we can further divide into two kinds, with free positions and with fixed positions. We show that both types of partial inverse sorting problems can be solved by a combination of a sorting problem and an inverse sorting problem.
Xiaoguang Yang, Jianzhong Zhang 0001
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Xiaoguang Yang, Jianzhong Zhang 0001
Comments (0)
books