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

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 (...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 275; pp. 126 - 133
Main Authors Takazawa, Yotaro, Mizuno, Shinji, Kitahara, Tomonari
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 31.03.2020
Elsevier BV
Subjects
Algorithms
Approximation
Approximation algorithms
Integers
Mathematical analysis
Partial covering 0–1 integer program
Primal–dual method
Primal–dual method
Approximation algorithms
Partial covering 0–1 integer program
Online AccessGet full text

Cover

More Information
Summary: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).
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.08.024