NDLI: Approximation of Partial Capacitated Vertex Cover

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Rawitz, Dror Flysher, Guy Bar-Yehuda, Reuven Mestre, Julin
Copyright Year	2010
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 (or load) $\ell(e)$, and each vertex v is associated with a (soft) 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 $\sum_{v}\alpha(v)w(v)$, where $\alpha(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 the total demand of edges assigned to v is at most $\alpha(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. We also present 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.
Starting Page	1441
Ending Page	1469
Page Count	29
File Format	PDF
ISSN	08954801
DOI	10.1137/080728044
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	4
Volume Number	24
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2010-11-04
Access Restriction	Subscribed
Subject Keyword	partial covering local ratio technique Approximation algorithms approximation algorithms capacitated covering Graph algorithms Analysis of algorithms prize collecting covering
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximation of partial capacitated vertex cover

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover

An Extension of the NemhauserTrotter Theorem to Generalized Vertex Cover with Applications

Approximation of partial capacitated vertex cover (2007).

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

Using homogenous weights for approximating the partial cover problem

Approximation Algorithms for Partial Covering Problems (2001)

Approximation algorithms for partial covering problems.

Approximation Algorithms for Partial Covering Problems (2001)

Approximation of Partial Capacitated Vertex Cover

Similar Documents

Approximation of partial capacitated vertex cover

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover

An Extension of the NemhauserTrotter Theorem to Generalized Vertex Cover with Applications

Approximation of partial capacitated vertex cover (2007).

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

Using homogenous weights for approximating the partial cover problem

Approximation Algorithms for Partial Covering Problems (2001)

Approximation algorithms for partial covering problems.

Approximation Algorithms for Partial Covering Problems (2001)

Approximation of Partial Capacitated Vertex Cover