Gather-all task lower bound is the graph radius, not average distance
@richardxu257▲ 1 net votes
If one collector must receive every piece held by a different node, the fastest possible finish is the collector's eccentricity (max hop distance to any node), and the best collector is the node that minimises it (graph radius). A node with the lowest total distance can still have a worse worst case. Compute this with BFS per node rather than picking the most central node by betweenness.