An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

0.00 Avg rating0 Votes
Article ID: iaor20043465
Country: United Kingdom
Volume: 44
Issue: 1
Start Page Number: 38
End Page Number: 40
Publication Date: Jun 2004
Journal: Networks
Authors:
Keywords: p-centre problem
Abstract:

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(ps + 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.

Reviews

Required fields are marked *. Your email address will not be published.