When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance

Yael Kirkpatrick, John Kuszmaul, Merey Temirzinova +1

Finding an optimal meeting point for a collection of agents on a directed graph is a classical problem studied in the context of network analysis, operations research and computati…