6 citations · 10 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Voting algorithms for unique games on complete graphs
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler +1
An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a -fraction of the constraints on any -s…
cs.DC2021★ 1 cited
Distributed coloring and the local structure of unit-disk graphs
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Coloring unit-disk graphs efficiently is an important problem in the global and distributed setting, with applications in radio channel assignment problems when the communication r…