activity
20102024
most citedThe Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications

112 citations · 667 across the 96 of their papers we have counts for

collaborators
Showing 2016 · cs.DCShow all

1 paper · 2 filters

cs.DC2016

A local constant factor approximation for the minimum dominating set problem on bounded genus graphs

Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz

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-kn…