Near Tight Shortest Paths in the Hybrid Model

Philipp Schneider

Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in or…