The orthogonal CNN problem

Authors:
Kazuo Iwama;Kouki Yonezawa
Affiliations:
School of Informatics, Kyoto University, Kyoto 606-8501, Japan;School of Informatics, Kyoto University, Kyoto 606-8501, Japan
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 1

Competitive algorithms for server problems

Journal of Algorithms
Competitive algorithms for the weighted server problem

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A competitive algorithm for the general 2-server problem

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Online chasing problems for regular polygons

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The online CNN problem had no known competitive algorithms for a long time. Sitters, Stougie and de Paepe showed that there exists a competitive online algorithm for this problem. However, both their algorithm and analysis are quite complicated, and above all, their upper bound for the competitive ratio is 105. In this paper, we examine why this problem seems so difficult. To this end we introduce a nontrivial restriction, orthogonality, against this problem and show that it decreases the competitive ratio dramatically, down to at most 9.