We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. obtain poly(log log n )-round following problems unweighted undirected -vertex graphs: ( 1 + ϵ )-approximation multi-source (MSSP) from O (√ ) sources. (2 all pairs (APSP). (1 , β)-approximation APSP where β = (log / . These bounds improve exponentially over stat...