Rounding to an integral program

Refael Hassin, Danny Segev

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)44-54
Number of pages11
JournalLecture Notes in Computer Science
StatePublished - 2005
Externally publishedYes
Event4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 - Santorini Island, Greece
Duration: 10 May 200513 May 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Rounding to an integral program'. Together they form a unique fingerprint.

Cite this