An O() version of the Averbakh–Berman algorithm for the robust median of a tree

An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians

Oded Kariv, S. L. Hakimi · SIAM Journal on Applied Mathematics · 1979 · 1.3K citations

Engineering, Planar Graph, Network Analysis +18

A linear-time algorithm for a special case of disjoint set union

Harold N. Gabow, Robert E. Tarjan · Journal of Computer and System Sciences · 1985 · 555 citations

Mathematical Programming, Engineering, Linear-time Algorithm +7

Optimal Center Location in Simple Networks

A. J. Goldman · Transportation Science · 1971 · 390 citations

Engineering, Network Planning, Reduction Procedure +18

Minmax-regret robust 1-median location on a tree

Bintong Chen, Chin‐Shien Lin · Networks · 1998 · 107 citations

Mathematical Programming, Engineering, Network Analysis +18

Minmax Regret Median Location on a Network Under Uncertainty

Igor Averbakh, Oded Berman · INFORMS journal on computing · 2000 · 86 citations

Mathematical Programming, Engineering, Network Analysis +19