A Local Constant Factor MDS Approximation for Bounded Genus Graphs


The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on… (More)
DOI: 10.1145/2933057.2933084


2 Figures and Tables


Citations per Year

Citation Velocity: 13

Averaging 13 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics