Abstract. We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in the congest model.

Oct 7, 2020 · We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in the congest model. Through a connection to ...

Improved Hardness of Approximation of Diameter in the CONGEST Model · O. Grossman, Seri Khoury, A. Paz · Published in International Symposium on… 2020 ...

Improved Hardness of Approximation of Diameter in the CONGEST Model. Ofer Grossman, Seri Khoury, Ami Paz. Research Group Theory and Applications of Algorithms.

Oct 7, 2020 · Improved Hardness of Approximation of Diameter in the CONGEST Model ... Krzysztof Nowicki: Spanning Trees and Small Cuts in Congested Clique.

Improved Hardness of Approximation of Diameter in the CONGEST Model ; Event Title. International Symposium on DIStributed Computing (DISC) 2020 ; Divisions.

In this note, we revisit hardness of computing a diameter approximation in the CONGEST model from a fine-grained perspective. The current fastest approximation ...

We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in the congest model.

Abstract. We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in the congest model.

Improved hardness of approximation of diameter in the CONGEST model. O Grossman, S Khoury, A Paz. 12, 2020. The topology of local computing in networks. P ...