Elsevier

Journal of Algorithms

Volume 34, Issue 1, January 2000, Pages 90-108
Journal of Algorithms

Regular Article
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

https://doi.org/10.1006/jagm.1999.1020Get rights and content

Abstract

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum eccentricity and minimum distancesum. Let n be the number of vertices in the tree network. Our algorithm for finding a minimum eccentricity location of a path-shaped facility takes O(log n) time using O(n) work. Our algorithm for finding a minimum distancesum location of a path-shaped facility takes O(log n) time using O(n2) work. Both of our algorithms for finding the minimum eccentricity location and a minimum distancesum location of a tree-shaped facility take O(log n log log n) time using O(n) work. In the sequential case, all the proposed algorithms are faster than those previously proposed by Minieka. Recently, Peng and Lo have proposed parallel algorithms for all the four problems considered in this paper. They assumed that each edge in the tree network is of length 1. Thus, as compared with their algorithms ours are more general. Besides, our algorithms for the problems of finding a minimum eccentricity location of a path-shaped facility, the minimum eccentricity location of a tree-shaped facility, and a minimum distancesum location of a tree-shaped facility are more efficient from the aspect of work. Their algorithms for these three problems use O(n log n) work. Ours use O(n) work.

References (21)

There are more references available in the full text version of this article.

Cited by (26)

  • Efficient algorithms for the minmax regret path center problem with length constraint on trees

    2022, Theoretical Computer Science
    Citation Excerpt :

    More applications can be found in [25,30]. The problems of locating extensive facilities have been comprehensively studied in the literature [3,13,26,28,31,35–39]. For excellent surveys of extensive facility location problems, we refer to [25,30].

  • An improved algorithm for the minmax regret path center problem on trees

    2020, Journal of Computer and System Sciences
    Citation Excerpt :

    Path- and tree-shaped facilities are called extensive facilities. The problems of locating points and extensive facilities on the center and median models have been comprehensively studied in the literature [3,12,20,21,25,27,30,34–36]. For excellent surveys of extensive facility location problems on networks, we refer to [24,29].

  • An improved algorithm for the minmax regret path centdian problem on trees

    2018, Journal of Computer and System Sciences
    Citation Excerpt :

    Path- and tree-shaped facilities are called extensive facilities. The problems of locating points and extensive facilities on the center, median, and centdian models have been comprehensively studied in the literature [1,5,9,18–22,26,29,34–36]. Traditionally, network location theory has been concerned with networks in which the vertex weights and edge lengths are given precisely.

  • On the minmax regret path median problem on trees

    2015, Journal of Computer and System Sciences
    Citation Excerpt :

    In summary, we obtain the following. A well-known generalization of the path median problem is the problem of locating a median path of limited length [1,33]. One direction for further study is to design an efficient algorithm for this generalized problem on the minmax regret model.

  • Algorithms for central-median paths with bounded length on trees

    2007, European Journal of Operational Research
View all citing articles on Scopus

This research is supported by the National Science Council of the Republic of China under Grant NSC-87-2213-E-007-066.

f1

[email protected]

View full text