Michal Hanckowiak

Learn More
We give deterministic distributed algorithms that given δ > 0 find in a planar graph G, (1 ± δ)-approximations of a maximum independent set, a maximum matching, and a minimum dominating set. The algorithms run in O(log∗ |G|) rounds. In addition, we prove that no faster deterministic approximation is possible and show that if randomization is allowed it is(More)
One of the fascinating questions of computer science is whether and to what extent randomization increases the power of algorithmic procedures. It is well-known that, in general, randomization makes distributed algorithms more powerful, for there are examples of basic coordination tasks in asynchronous systems which cannot be solved by deterministic(More)
We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2 3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log |V (G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in(More)