Approximation algorithms for the covering-type k-violation linear program

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Research output: Contribution to journalArticle

Abstract

We study the covering-type k-violation linear program where at most k of the constraints can be violated. This problem is formulated as a mixed integer program and known to be strongly NP-hard. In this paper, we present a simple (k+ 1) -approximation algorithm using a natural LP relaxation. We also show that the integrality gap of the LP relaxation is k+ 1. This implies we can not get better approximation algorithms when we use the LP-relaxation as a lower bound of the optimal value.

Original languageEnglish
JournalOptimization Letters
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

LP Relaxation
Linear Program
Approximation Algorithms
Covering
Mixed Integer Program
Integrality
NP-complete problem
Lower bound
Imply

All Science Journal Classification (ASJC) codes

  • Control and Optimization

Cite this

Approximation algorithms for the covering-type k-violation linear program. / Takazawa, Yotaro; Mizuno, Shinji; Kitahara, Tomonari.

In: Optimization Letters, 01.01.2019.

Research output: Contribution to journalArticle

@article{76f256b4ab0b40848ff14a146958a496,
title = "Approximation algorithms for the covering-type k-violation linear program",
abstract = "We study the covering-type k-violation linear program where at most k of the constraints can be violated. This problem is formulated as a mixed integer program and known to be strongly NP-hard. In this paper, we present a simple (k+ 1) -approximation algorithm using a natural LP relaxation. We also show that the integrality gap of the LP relaxation is k+ 1. This implies we can not get better approximation algorithms when we use the LP-relaxation as a lower bound of the optimal value.",
author = "Yotaro Takazawa and Shinji Mizuno and Tomonari Kitahara",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s11590-019-01425-w",
language = "English",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Approximation algorithms for the covering-type k-violation linear program

AU - Takazawa, Yotaro

AU - Mizuno, Shinji

AU - Kitahara, Tomonari

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We study the covering-type k-violation linear program where at most k of the constraints can be violated. This problem is formulated as a mixed integer program and known to be strongly NP-hard. In this paper, we present a simple (k+ 1) -approximation algorithm using a natural LP relaxation. We also show that the integrality gap of the LP relaxation is k+ 1. This implies we can not get better approximation algorithms when we use the LP-relaxation as a lower bound of the optimal value.

AB - We study the covering-type k-violation linear program where at most k of the constraints can be violated. This problem is formulated as a mixed integer program and known to be strongly NP-hard. In this paper, we present a simple (k+ 1) -approximation algorithm using a natural LP relaxation. We also show that the integrality gap of the LP relaxation is k+ 1. This implies we can not get better approximation algorithms when we use the LP-relaxation as a lower bound of the optimal value.

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

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

U2 - 10.1007/s11590-019-01425-w

DO - 10.1007/s11590-019-01425-w

M3 - Article

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

ER -