Parallel Complexity of Additive Location Problems

Parallel NC-algorithms for a general class of multifacility location problems on a tree with identical facilities and the minisum objective function are presented. The class includes the p-median problem, the p-coverage problem, and the uncapacitated plant location problem.