eldorado.tu-dortmund.de/server/api/core/bitstreams/f43ccd0a-8a95-43e7-83f6-fd6b8cd3d2cb/content
4 2, 3, 4, 10 2, 6, 7, 10
2, 3, 6, 10 3, 4, 8, 10 2, 4, 7, 10 3, 6, 8, 10
5 4, 6, 11, 14, 30 5, 8, 12, 16, 30 4, 6, 11, 16, 30 5, 8, 14, 18, 30 4, 6, 14, 19, 30 5, 8, 16, 18, 30 4, 6, 16, 19, 30 5, 12 [...] side. Let
LT := {d ∈ {−1, 0, 1}n | 2 ≤ |d| 6=0 ≤ `,
nX i=1
diWi ≤ −1}
EQ := {d ∈ {−1, 0, 1}n | 2 ≤ |d| 6=0 ≤ `,
nX i=1
diWi = 0}
GT := {d ∈ {−1, 0, 1}n | 2 ≤ |d| 6=0 ≤ `,
nX i=1
diWi ≥ 1}
Since all di and [...] 12, 16, 22, 30 4, 11, 16, 24, 30 6, 11, 14, 26, 30 5, 8, 12, 14, 30 8, 14, 18, 25, 30
Table 6. Worst-case instances that maximize wn∗ n for n ≤ 5.
n W1, . . . , Wn
6 12, 15, 16, 20, 22, 86 7 11, 76, 78 …