Approximation algorithms for the covering-type k-violation linear program
- 7 Downloads
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.
KeywordsApproximation algorithms Mixed integer program k-violation linear program Linear relaxation Rounding algorithm
We thank the anonymous referees for their helpful comments and suggestions. 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.
- 3.Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642–651. Society for Industrial and Applied Mathematics (2001)Google Scholar
- 4.Chen, K.: A constant factor approximation algorithm for k-median clustering with outliers. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 8, pp. 826–835 (2008)Google Scholar
- 10.Takazawa, Y., Mizuno, S., Kitahara, T.: An approximation algorithm for the partial covering 0–1 integer program. Discrete Appl. Math. (2017). https://doi.org/10.1016/j.dam.2017.08.024