Abstract#R##N##R##N#In a recent article Averbakh and Berman present an O(p3 + n2) serial algorithm to solve the distance constrained p-center location problem with mutual communication on a tree network with n nodes. In this note we suggest two simple modifications leading to the improved (subquadratic in n), O(p3 + p(n + p)log2(n + p)) complexity bound. We also present a new O(p2n log n log(n + p)) algorithm for the discrete version of this problem. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(1), 38–40 2004
['Arie Tamir']
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks