An approximation algorithm for the partial covering 0–1 integer program

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The partial covering 0–1 integer program (PCIP) is a relaxed problem of the covering 0–1 integer program (CIP) such that some fixed number of constraints may not be satisfied. This type of relaxation is also discussed in the partial set multi-cover problem (PSMCP) and the partial set cover problem (PSCP). In this paper, we propose an approximation algorithm for PCIP by extending an approximation algorithm for PSCP by Gandhi et al. (2004).

Original languageEnglish
Pages (from-to)126-133
Number of pages8
JournalDiscrete Applied Mathematics
Volume275
DOIs
Publication statusPublished - Mar 31 2020

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this