An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of "Quick" (Q) and "Slow" (S) symbols, whi...
Manolis Christodoulakis, Costas S. Iliopoulos, Moh...