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

Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

研究成果: Contribution to journalArticle

抜粋

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.

元の言語英語
ページ(範囲)1515-1521
ページ数7
ジャーナルOptimization Letters
13
発行部数7
DOI
出版物ステータス出版済み - 10 1 2019

All Science Journal Classification (ASJC) codes

  • Control and Optimization

フィンガープリント Approximation algorithms for the covering-type k-violation linear program' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用