Geodesic
Arranging numbers on circles to reach maximum total variations
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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\ge 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.
DOI : 10.37236/965
Classification : 05A05, 05B30 
Ying-Jie Liao; Min-Zheng Shieh; Shi-Chun Tsai. Arranging numbers on circles to reach maximum total variations. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/965
@article{10_37236_965,
     author = {Ying-Jie Liao and Min-Zheng Shieh and Shi-Chun Tsai},
     title = {Arranging numbers on circles to reach maximum total variations},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/965},
     zbl = {1122.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/965/}
}
TY  - JOUR
AU  - Ying-Jie Liao
AU  - Min-Zheng Shieh
AU  - Shi-Chun Tsai
TI  - Arranging numbers on circles to reach maximum total variations
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/965/
DO  - 10.37236/965
ID  - 10_37236_965
ER  - 
%0 Journal Article
%A Ying-Jie Liao
%A Min-Zheng Shieh
%A Shi-Chun Tsai
%T Arranging numbers on circles to reach maximum total variations
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/965/
%R 10.37236/965
%F 10_37236_965

Cité par Sources :