2026-07-23T13:54:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6810 2024-03-06T10:38:56Z ddc:004 open_access

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities Kao, Mong-Jen Tu, Hai-Lun Lee, D. T. Capacitated Covering Hard Capacities Bi-criteria Approximation We consider capacitated vertex cover with hard capacity constraints (VC-HC) 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 minimum-weight 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) bi-approximation for VC-HC that gives a trade-off 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mong-Jen Kao and Hai-Lun Tu and D. T. Lee 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.40 urn:nbn:de:0030-drops-68102 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.40 eng https://creativecommons.org/licenses/by/3.0/legalcode