On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs

Vahan Mkrtchyan
  • Function : Author
  • PersonId : 994191
Ojas Parekh
  • Function : Author
  • PersonId : 994192
K. Subramani
  • Function : Author
  • PersonId : 994193

Abstract

Graphs are often used to model risk management in various systems. Particularly, Caskurlu et al. in [6] have considered a system which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. It can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the vertex cover problem is in P on bipartite graphs; however, the computational complexity of the partial vertex cover problem on bipartite graphs is open. In this paper, we show that the partial vertex cover problem is NP-hard on bipartite graphs. Then, we show that the budgeted maximum coverage problem (a problem related to partial vertex cover problem) admits an $\frac{8}{9}$-approximation algorithm in the class of bipartite graphs, which matches the integrality gap of a natural LP relaxation.
Fichier principal
Vignette du fichier
978-3-662-44602-7_2_Chapter.pdf (287.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402014 , version 1 (24-11-2016)

Licence

Attribution

Identifiers

Cite

Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.13-26, ⟨10.1007/978-3-662-44602-7_2⟩. ⟨hal-01402014⟩
124 View
1024 Download

Altmetric

Share

Gmail Facebook X LinkedIn More