Multiple covers with balls I: Inclusion-exclusion

Inclusion-exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion-exclusion formulas for the subset of Rn covered by at least k balls in a finite set. We implement two of the formulas in dimension n=3 and report on results obtained with our software.