| Paper Abstract and Keywords |
| Presentation |
2005-10-19 09:35
Automated Competitive Analysis of Online Problems
Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK)
which is an extension of the 2-Bin Removable Online Knapsack Problem.
We prove an optimal upper bound of $1/t$ for the competitive ratio
of 2EOK, where $t$ is a real root of $4x^3 + 5x^2 - x - 4 = 0$
($t \approx 0.76850$ and $1/t \approx 1.3012$). To prove this result,
we made a full use of computer programs as follows:
For the algorithm we wish to prove the upper bound, we first construct
an equivalent finite state diagram with about 300 states. Then for each
state we generate a finite set of inequalities such that the competitive
ratio at that state is at most $1/t$ if the set of inequalities do not
have a real solution. The latter can be checked by Mathematica. The
number of inequalities generated was approximately 600 in total, and
our computation time was 30 minutes using Athlon XP 2600+. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
online problems / online algorithms / competitive ratio / online knapsack problem / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 105, no. 344, COMP2005-45, pp. 7-12, Oct. 2005. |
| Paper # |
COMP2005-45 |
| Date of Issue |
2005-10-12 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 |
| Download PDF |
|
| Conference Information |
| Committee |
COMP |
| Conference Date |
2005-10-18 - 2005-10-19 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Tohoku Univ. |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2005-10-COMP |
| Language |
English |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Automated Competitive Analysis of Online Problems |
| Sub Title (in English) |
|
| Keyword(1) |
online problems |
| Keyword(2) |
online algorithms |
| Keyword(3) |
competitive ratio |
| Keyword(4) |
online knapsack problem |
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Takashi Horiyama |
| 1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
| 2nd Author's Name |
Kazuo Iwama |
| 2nd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
| 3rd Author's Name |
Jun Kawahara |
| 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-3 |
| Date Time |
2005-10-19 09:35:00 |
| Presentation Time |
35 minutes |
| Registration for |
COMP |
| Paper # |
COMP2005-45 |
| Volume (vol) |
vol.105 |
| Number (no) |
no.344 |
| Page |
pp.7-12 |
| #Pages |
6 |
| Date of Issue |
2005-10-12 (COMP) |