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

From MaRDI portal
Revision as of 21:58, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (9)






This page was built for publication: On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs