An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 25 June 2018Accepted: 05 January 2021Published online: 08 April 2021Keywords$k$-center, trees, algorithms, computational geometry, facility locationsAMS Subject Headings68W40Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat