A Lower Bound for Distributed Averaging Algorithms on the Line Graph

DOI10.1109/TAC.2011.2159652zbMATH Open1368.93011OpenAlexW2052560303MaRDI QIDQ5347901FDOQ5347901

Authors: Alex Olshevsky, John N. Tsitsiklis 

Publication date: 25 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2011.2159652

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decentralized systems (93A14) Eigenvalue problems (93B60)

Cited In (2)

• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• Tight distortion bounds for distributed metric voting on a line

This page was built for publication: A Lower Bound for Distributed Averaging Algorithms on the Line Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347901)