Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Optimization Year : 2018

Dates and versions

hal-02073599 , version 1 (20-03-2019)

Identifiers

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⟩
80 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More