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

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

研究成果: ジャーナルへの寄稿記事

1 引用 (Scopus)

抜粋

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

元の言語英語
ページ(範囲)126-133
ページ数8
ジャーナルDiscrete Applied Mathematics
275
DOI
出版物ステータス出版済み - 3 31 2020
外部発表Yes

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

これを引用