Please use this identifier to cite or link to this item:
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
Approximation Algorithm
Issue Date: 2017
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.
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


checked on Jun 3, 2023


checked on Sep 24, 2022

Page view(s)

checked on Jun 5, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.