Covering a Set with Arithmetic Progressions is NP-Complete
1989) Covering a Set with Arithmetic Progressions is NP-Complete. Technical Report TR-89-25, Computer Science, Virginia Polytechnic Institute and State University. (
Full text available as:
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.
|Item Type:||Departmental Technical Report|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|