É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]
Abstract is missing.