Kao, MongJen ;
Tu, HaiLun ;
Lee, D. T.
O(f) BiApproximation for Capacitated Covering with Hard Capacities
Abstract
We consider capacitated vertex cover with hard capacity constraints (VCHC) on hypergraphs. In this problem we are given a hypergraph G = (V, E) with a maximum edge size f. Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimumweight vertex multiset such that the demands of the edges can be covered by the capacities of the vertices and the multiplicity of each vertex does not exceed its available multiplicity.
In this paper we present an O(f) biapproximation for VCHC that gives a tradeoff on the number of augmented multiplicity and the cost of the resulting cover. In particular, we show that, by augmenting the available multiplicity by a factor of k geq 2, a cover with a cost ratio of (1+ frac{1}{k  1})(f  1) to the optimal cover for the original instance can be obtained. This improves over a previous result, which has a cost ratio of f^2 via augmenting the available multiplicity by a factor of f.
BibTeX  Entry
@InProceedings{kao_et_al:LIPIcs:2016:6810,
author = {MongJen Kao and HaiLun Tu and D. T. Lee},
title = {{O(f) BiApproximation for Capacitated Covering with Hard Capacities}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {40:140:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770262},
ISSN = {18688969},
year = {2016},
volume = {64},
editor = {SeokHee Hong},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6810},
URN = {urn:nbn:de:0030drops68102},
doi = {10.4230/LIPIcs.ISAAC.2016.40},
annote = {Keywords: Capacitated Covering, Hard Capacities, Bicriteria Approximation}
}
2016
Keywords: 

Capacitated Covering, Hard Capacities, Bicriteria Approximation 
Seminar: 

27th International Symposium on Algorithms and Computation (ISAAC 2016)

Issue date: 

2016 
Date of publication: 

2016 