Covering a Set with Arithmetic Progressions is NP-Complete

Abstract

This paper defines a new class of set covering problems in which the subsets are implicitly derived from the properties of the set elements. In particular, the set elements are integers and the subsets are finite arithmetic progressions. Both minimum cover and exact cover problems are defined. Both problems are shown to be NP-Complete.