TY - JOUR
T1 - An approximation algorithm for the partial covering 0–1 integer program
AU - Takazawa, Yotaro
AU - Mizuno, Shinji
AU - Kitahara, Tomonari
N1 - Funding Information:
This research is supported in part by Grant-in-Aid for Science Research (A) 26242027 of Japan Society for the Promotion of Science and Grant-in-Aid for Young Scientist (B) 15K15941 .
Publisher Copyright:
© 2017 Elsevier B.V.
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 -