An O(pn2) algorithm for the p-median and related problems on tree graphs

An O(pn2) algorithm for the p-median and related problems on tree graphs

0.00 Avg rating—0 Votes
Article ID: iaor2001962
Volume: 19
Issue: 2
Start Page Number: 59
End Page Number: 64
Publication Date: Aug 1996
Journal: Operations Research Letters
Authors:
Keywords: programming: dynamic, location
Abstract:

We improve the complexity bound of the p-median problem on trees by showing that the total running time of the ‘leaves to root’ dynamic programming algorithm is O(pn2).

Reviews

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