One of the first algorithm any mathematician learns about is the Euclidean division algorithm for the rational integer ring Z. When asking whether other integer rings have similar such division algorithms, we are then led naturally to a geometric interpretation of this algorithm which concerns lattices and their (multiplicative) covering radius. In particular, we look for a uniform upper bound for the covering radius, and the most well known conjecture regarding this bound is Minkowski's conjecture.