--
Thomas Nowak
(LRI)
We introduce a new class of distributed algorithms for the approximate
consensus problem in dynamic rooted networks, which we call amortized
averaging algorithms. They are deduced from ordinary averaging
algorithms by adding a value-gathering phase before each value update.
This allows their decision time to drop from being exponential in ...
