| Article ID: | iaor20002650 |
| Country: | United States |
| Volume: | 11 |
| Issue: | 3 |
| Start Page Number: | 292 |
| End Page Number: | 298 |
| Publication Date: | Jun 1999 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Berman Oded, Averbakh Igor |
| Keywords: | computational analysis: parallel computers |
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.