The $p$-Center Problem in Tree Networks Revisited

Aritra Banik, Binay Bhattacharya, Sandip Das +2

We present two improved algorithms for weighted discrete $p$-center problem for tree networks with $n$ vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…