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

Yotaro Takazawa; Shinji Mizuno; Tomonari Kitahara

doi:10.1016/j.dam.2017.08.024

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

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	126-133
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	275
DOIs	https://doi.org/10.1016/j.dam.2017.08.024
Publication status	Published - Mar 31 2020
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2017.08.024

Fingerprint Dive into the research topics of 'An approximation algorithm for the partial covering 0–1 integer program'. Together they form a unique fingerprint.

Cite this

@article{ae2496744e1e48199febdc74118befa9,

title = "An approximation algorithm for the partial covering 0–1 integer program",

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).",

author = "Yotaro Takazawa and Shinji Mizuno and Tomonari Kitahara",

year = "2020",

month = mar,

day = "31",

doi = "10.1016/j.dam.2017.08.024",

language = "English",

volume = "275",

pages = "126--133",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Takazawa, Yotaro

AU - Mizuno, Shinji

AU - Kitahara, Tomonari

PY - 2020/3/31

Y1 - 2020/3/31

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=85029611933&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029611933&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2017.08.024

DO - 10.1016/j.dam.2017.08.024

M3 - Article

AN - SCOPUS:85029611933

VL - 275

SP - 126

EP - 133

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -