標題: Arranging numbers on circles to reach maximum total variations
作者: Liao, Ying-Jie
Shieh, Min-Zheng
Tsai, Shi-Chun
資訊工程學系
Department of Computer Science
公開日期: 28-Jun-2007
摘要: 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.
URI: http://hdl.handle.net/11536/10668
ISSN: 1077-8926
期刊: ELECTRONIC JOURNAL OF COMBINATORICS
Volume: 14
Issue: 1
結束頁: 
Appears in Collections:Articles