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

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Research output: Contribution to journalArticle

2 Citations (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
JournalDiscrete Applied Mathematics
DOIs
Publication statusAccepted/In press - Jan 1 2017
Externally publishedYes

Fingerprint

Integer Program
Approximation algorithms
Approximation Algorithms
Covering
Partial
Set Cover
Multiset
Cover

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

An approximation algorithm for the partial covering 0-1 integer program. / Takazawa, Yotaro; Mizuno, Shinji; Kitahara, Tomonari.

In: Discrete Applied Mathematics, 01.01.2017.

Research output: Contribution to journalArticle

@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 = "2017",
month = "1",
day = "1",
doi = "10.1016/j.dam.2017.08.024",
language = "English",
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 - 2017/1/1

Y1 - 2017/1/1

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

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -