Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/1167
Title: | Partial vertex cover and budgeted maximum coverage in bipartite graphs | Authors: | Çaşkurlu, Buğra Mkrtchyan, Vahan Parekh, Ojas Subramani, Kiruba Sankaran |
Keywords: | Vertex Cover Partial Vertex Cover Budgeted Maximum Coverage Problem Np-Completeness Approximation Algorithm |
Publisher: | SIAM Publications | Source: | Caskurlu, B., Mkrtchyan, V., Parekh, O., & Subramani, K. (2017). Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM Journal on Discrete Mathematics, 31(3), 2172-2184. | Abstract: | In this paper, we study two closely related problems on bipartite graphs, viz., the partial vertex cover problem and the budgeted maximum coverage problem. Both these problems arise in a number of different application domains, including, but not limited to, computer security and transportation logistics. It is well known that the vertex cover problem is solvable in polynomial time on bipartite graphs. However, the computational complexity of the partial vertex cover problem on bipartite graphs was open, thus far. In this paper, we establish that the partial vertex cover problem is NP-hard, even on bipartite graphs. Our result also establishes that the closely related budgeted maximum coverage problem is NP-hard on bipartite graphs. For the latter problem, we present an 8/9-approximation algorithm. Our approximation guarantee matches and resolves the integrality gap of the natural linear programming relaxation for this problem and improves upon a recent 4/5-approximation algorithm for the same problem. | URI: | https://epubs.siam.org/doi/10.1137/15M1054328 https://hdl.handle.net/20.500.11851/1167 |
ISSN: | 0895-4801 |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
5
checked on Sep 7, 2024
WEB OF SCIENCETM
Citations
8
checked on Sep 7, 2024
Page view(s)
202
checked on Sep 2, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.