Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks


We present a distributed algorithm that finds a maximal edge packing in <i>O</i>(Δ + log* <i>W</i>) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and <i>W</i> is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for… (More)
DOI: 10.1145/1810479.1810533
View Slides


  • Presentations referencing similar topics