Geometric median in nearly linear time


In this paper we provide faster algorithms for solving the geometric median problem: given <i>n</i> points in <sup><i>d</i></sup> compute a point that minimizes the sum of Euclidean distances to the points. This is one of the oldest non-trivial problems in computational geometry yet despite a long history of research the previous fastest running times for… (More)
DOI: 10.1145/2897518.2897647


1 Figure or Table


Citations per Year

Citation Velocity: 29

Averaging 29 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics