Approximation of partial capacitated vertex cover

Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We study the partial capacitated vertex cover problem (PCVC) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand ℓ(e), and each vertex v is associated with a capacity c(v) and a weight w(v). A feasible solution is an assignment of edges to vertices such that the total demand of assigned edges is at least L. The weight of a solution is ∑v α(v)w(v), where α(v) is the number of copies of v required to cover the demand of the edges that are assigned to v. The goal is to find a solution of minimum weight. We consider three variants of PCVC. In PCVC with separable demands the only requirement is that total demand of edges assigned to v is at most α(v)c(v). In pcvc with inseparable demands there is an additional requirement that if an edge is assigned to v then it must be assigned to one of its copies. The third variant is the unit demands version. We present 3-approximation algorithms for both PCVC with separable demands and PCVC with inseparable demands and a 2-approximation algorithm for PCVC with unit demands. We show that similar results can be obtained for PCVC in hypergraphs and for the prize collecting version of capacitated vertex cover. Our algorithms are based on a unified approach for designing and analyzing approximation algorithms for capacitated covering problems. This approach yields simple algorithms whose analyses rely on the local ratio technique and sophisticated charging schemes.

Original languageEnglish
Title of host publicationAlgorithms - ESA 2007 - 15th Annual European Symposium, Proceedings
PublisherSpringer Verlag
Pages335-346
Number of pages12
ISBN (Print)9783540755197
DOIs
StatePublished - 2007
Externally publishedYes
Event15th Annual European Symposium on Algorithms, ESA 2007 - Eilat, Israel
Duration: 8 Oct 200710 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4698 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th Annual European Symposium on Algorithms, ESA 2007
Country/TerritoryIsrael
CityEilat
Period8/10/0710/10/07

Fingerprint

Dive into the research topics of 'Approximation of partial capacitated vertex cover'. Together they form a unique fingerprint.

Cite this