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

Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. In Josep Diaz, Ivan Lanese, Davide Sangiorgi, editors, Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Volume 8705 of Lecture Notes in Computer Science, pages 13-26, Springer, 2014. [doi]

@inproceedings{CaskurluMPS14,
  title = {On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs},
  author = {Bugra Caskurlu and Vahan Mkrtchyan and Ojas Parekh and K. Subramani},
  year = {2014},
  doi = {10.1007/978-3-662-44602-7_2},
  url = {http://dx.doi.org/10.1007/978-3-662-44602-7_2},
  researchr = {https://researchr.org/publication/CaskurluMPS14},
  cites = {0},
  citedby = {0},
  pages = {13-26},
  booktitle = {Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings},
  editor = {Josep Diaz and Ivan Lanese and Davide Sangiorgi},
  volume = {8705},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-44601-0},
}