Arranging numbers on circles to reach maximum total variations

Ying Jie Liao*, Min-Zheng Shieh, Shi-Chun Tsai

*Corresponding author for this work

研究成果: Article

2 引文 斯高帕斯(Scopus)


The dartboard problem is to arrange n numbers on a circle to obtain maximum risk, which is the sum of the q-th power of the absolute differences of adjacent numbers, for q ≥ 1. Curtis showed that the dartboard problem admits a greedy algorithm. We generalize the dartboard problem by considering more circles and the goal is to arrange kn number on k circles to obtain the maximum risk. In this paper, we characterize an optimal arrangement for k = 2 and show that the generalized dartboard problem also admits a greedy algorithm.

期刊Electronic Journal of Combinatorics
發行號1 R
出版狀態Published - 28 六月 2007

指紋 深入研究「Arranging numbers on circles to reach maximum total variations」主題。共同形成了獨特的指紋。

  • 引用此