| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142810 | Operations Research Letters | 2008 | 6 Pages |
Abstract
This paper presents a framework for approximating NP-hard problems that can be formulated as integer-covering programs, possibly with additional side constraints, and the number of covering options is restricted in some sense, although this property may be well hidden.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Refael Hassin, Danny Segev,