Rounding to an Integral Program

We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as integer covering programs, possibly with additional side constraints. Second, the number of covering options is restricted in some sense, although this property may be well hidden. Our method is a natural extension of the threshold rounding technique.

• Type: Conference
• Year: 2005
• Where: WEA
• Authors: Refael Hassin, Danny Segev
• Keywords: Algorithms, Integer Covering Programs, NP-hard Problems, Underlying Properties, WEA 2005