Paper Abstract and Keywords |
Presentation |
2013-12-21 11:25
Efficient Algorithms for Sorting $k$-Sets in Bins Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
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 between adjacent bins.
How many swaps are needed to move all balls to the same numbered bins.
For this problem, we design an efficient greedy algorithm with $frac{k+1}{4}n^2+O(kn)$ swaps.
As $k$ and $n$ increase, this approaches the lower bound of $lceil binom{kn}{2}/(2k-1) rceil$.
In addition, we design a more efficient recursive algorithm using $frac{15}{16}n^2+O(n)$ swaps
for the $k=3$ case. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Greedy / Recursion / Mathematical puzzle / Sorting / Swap / / / |
Reference Info. |
IEICE Tech. Rep., vol. 113, no. 371, COMP2013-52, pp. 81-85, Dec. 2013. |
Paper # |
COMP2013-52 |
Date of Issue |
2013-12-13 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2013-52 |
Conference Information |
Committee |
COMP |
Conference Date |
2013-12-20 - 2013-12-21 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Okinawa Industry Support Center |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2013-12-COMP |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Efficient Algorithms for Sorting $k$-Sets in Bins |
Sub Title (in English) |
|
Keyword(1) |
Greedy |
Keyword(2) |
Recursion |
Keyword(3) |
Mathematical puzzle |
Keyword(4) |
Sorting |
Keyword(5) |
Swap |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Kazuhisa Seto |
1st Author's Affiliation |
Seikei University (Seikei Univ.) |
2nd Author's Name |
Junichi Teruyama |
2nd Author's Affiliation |
National Institute of Informatics (NII) |
3rd Author's Name |
Atsuki Nagao |
3rd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-2 |
Date Time |
2013-12-21 11:25:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2013-52 |
Volume (vol) |
vol.113 |
Number (no) |
no.371 |
Page |
pp.81-85 |
#Pages |
5 |
Date of Issue |
2013-12-13 (COMP) |
|