IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E98D(10) 1736-1743 2015年10月 [査読有り]
We propose efficient algorithms for Sorting k-Sets in Bins. The Sorting k-Sets in Bins problem can be described as follows. We are given numbered n bins with k balls in each bin. Balls in the i-th bin are numbered n-i+1. We can only swap balls bet...
ALGORITHMS AND COMPUTATION, WALCOM 2014 8344 225-236 2014年 [査読有り]
We give efficient algorithms for Sorting k-Sets in Bins. The Sorting k-Sets in Bins problem can be described as follows: We are given numbered n bins with k balls in each bin. Balls in the i-th bin are numbered n - i + 1. We can only swap balls be...