On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
Publication:3190147
DOI10.1007/978-3-662-44602-7_2zbMath1417.68149OpenAlexW9203110MaRDI QIDQ3190147
Ojas Parekh, Vahan V. Mkrtchyan, Bugra Caskurlu, K. Subramani and Vahan Mkrtchyan
Publication date: 15 September 2014
Published in: Advanced Information Systems Engineering (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01402014/file/978-3-662-44602-7_2_Chapter.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
This page was built for publication: On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs