Parallel Complexity of Additive Location Problems

References

• Averbakh I. , Berman O. Parallel complexity of additive location problems on a tree. (1994) . Working paper, University of Toronto Google Scholar
• Averbakh I. , Berman O. Parallel NC-algorithms for multifacility location problems on a tree and their applications. (1993) . Working paper, University of Toronto Google Scholar
• Broin M. W. , Lowe T. J. A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices. SIAM J. Algebraic Discrete Methods (1986) 7 348 357 Crossref, Google Scholar
• Discrete Location Theory Mirchandani P. , Francis R. L. (1990) (Wiley, New York) Google Scholar
• Hassin R. , Tamir A. Improved complexity bounds for location problems on the real line. Oper. Res. Lett. (1991) 10 395 402 Crossref, Google Scholar
• Kariv O. , Hakimi S. L. An algorithmic approach to network location problems: The p-medians. SIAM J. Appl. Math. (1979) 38 539 560 Crossref, Google Scholar
• Kindervater G. A. P. , Lenstra J. K. An introduction to parallelism in combinatorial optimization. Discrete Appl. Math. (1986) 14 135 156 Crossref, Google Scholar
• Kindervater G. A. P. , Lenstra J. K. The parallel complexity of TSP heuristics. J. Algorithms (1989) 10 249 270 Crossref, Google Scholar
• Kolen A. , Tamir A. , Mirchandani P. , Francis R. L. Covering problems. Discrete Location Theory (1990) (Wiley, New York) Google Scholar
• Megiddo N. , Zemel E. , Hakimi S. L. The maximum coverage location problem. SIAM J. Algebraic Discrete Methods (1983) 4 253 261 Crossref, Google Scholar
• Synthesis of Parallel Algorithms Reif J. (1993) (Kaufmann, San Mateo, CA) Google Scholar
• Tamir A. Complexity results for the p-median problem with mutual communication. Oper. Res. Lett. (1993) 14 79 84 Crossref, Google Scholar
• Tamir A. An O(pn 2) algorithm for the p-median and other related problems on tree graphs. (1995) . Working paper, School of Mathematical Sciences, Tel-Aviv University Google Scholar