author keywords: 2-median; binary search; linear time; priority queue; sorting; trees

TL;DR: A framework that unifies all efficient algorithms for the 2‐median problem on trees is presented, which isolates the nonlinear part of the computation so that future time‐bound improvements are easily incorporated. (via Semantic Scholar)