Finite sphere packing and sphere covering

A basic problem of finite packing and covering is to determine, for a given number ofk unit balls in Euclideand-spaceE ^d , (1) the minimal volume of all convex bodies into which thek balls can be packed and (2) the maximal volume of all convex bodies which can be covered by thek balls. In the sausage conjectures by L. Fejes Tóth and J. M. Wills it is conjectured that, for alld5, linear arrangements of thek balls are best possible. In the paper several partial results are given to support both conjectures. Furthermore, some relations between finite and infinite (space) packing and covering are investigated.This paper was written while the first named author was visiting the Forschungsinstitut für Geistes- und Sozialwissenschaften at the University of Siegen.