Hong, Eunpyeong ;
Kao, MongJen
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
Abstract
We consider the vertex cover problem with multiple coverage constraints in hypergraphs. In this problem, we are given a hypergraph G=(V,E) with a maximum edge size f, a cost function w: V  > Z^+, and edge subsets P_1,P_2,...,P_r of E along with covering requirements k_1,k_2,...,k_r for each subset. The objective is to find a minimum cost subset S of V such that, for each edge subset P_i, at least k_i edges of it are covered by S. This problem is a basic yet general form of classical vertex cover problem and a generalization of the edgepartitioned vertex cover problem considered by Bera et al.
We present a primaldual algorithm yielding an (f * H_r + H_r)approximation for this problem, where H_r is the r^{th} harmonic number. This improves over the previous ratio of (3cf log r), where c is a large constant used to ensure a low failure probability for MonteCarlo randomized algorithms. Compared to previous result, our algorithm is deterministic and pure combinatorial, meaning that no Ellipsoid solver is required for this basic problem. Our result can be seen as a novel reinterpretation of a few classical tight results using the language of LP primalduality.
BibTeX  Entry
@InProceedings{hong_et_al:LIPIcs:2018:9991,
author = {Eunpyeong Hong and MongJen Kao},
title = {{Approximation Algorithm for Vertex Cover with Multiple Covering Constraints}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {43:143:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770941},
ISSN = {18688969},
year = {2018},
volume = {123},
editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9991},
URN = {urn:nbn:de:0030drops99919},
doi = {10.4230/LIPIcs.ISAAC.2018.43},
annote = {Keywords: Vertex cover, multiple cover constraints, Approximation algorithm}
}
06.12.2018
Keywords: 

Vertex cover, multiple cover constraints, Approximation algorithm 
Seminar: 

29th International Symposium on Algorithms and Computation (ISAAC 2018)

Issue date: 

2018 
Date of publication: 

06.12.2018 