Rounding to an integral program

Refael Hassin*, Danny Segev

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)321-326
Number of pages6
JournalOperations Research Letters
Volume36
Issue number3
DOIs
StatePublished - May 2008

Keywords

  • Approximation algorithms
  • Integer covering
  • LP-rounding

Fingerprint

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

Cite this