Journal Articles
Discrete Optimization
Year : 2018
Bruno Escoffier : Connect in order to contact the contributor
https://hal.science/hal-02073599
Submitted on : Wednesday, March 20, 2019-9:28:14 AM
Last modification on : Tuesday, April 11, 2023-3:14:05 PM
Cite
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis. Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs. Discrete Optimization, 2018, 27, pp.26-56. ⟨10.1016/j.disopt.2017.09.001⟩. ⟨hal-02073599⟩
Collections
80
View
0
Download