Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis. A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. In Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, editors, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings. Volume 9644 of Lecture Notes in Computer Science, pages 235-248, Springer, 2016. [doi]
@inproceedings{BonnetEPS16,
title = {A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs},
author = {Édouard Bonnet and Bruno Escoffier and Vangelis Th. Paschos and Georgios Stamoulis},
year = {2016},
doi = {10.1007/978-3-662-49529-2_18},
url = {http://dx.doi.org/10.1007/978-3-662-49529-2_18},
researchr = {https://researchr.org/publication/BonnetEPS16},
cites = {0},
citedby = {0},
pages = {235-248},
booktitle = {LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings},
editor = {Evangelos Kranakis and Gonzalo Navarro and Edgar Chávez},
volume = {9644},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-49528-5},
}