7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2014
A 0.821-ratio purely combinatorial algorithm for maximum -vertex cover in bipartite graphs
Edouard Bonnet, Bruno Escoffier, Vangelis Paschos +1
Our goal in this paper is to propose a \textit{combinatorial algorithm} that beats the only such algorithm known previously, the greedy one. We study the polynomial approximation o…
cs.DM2009★ 7 cited
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos +1
Max Independent Set (MIS) is a paradigmatic problem in theoretical computer science and numerous studies tackle its resolution by exact algorithms with non-trivial worst-case compl…