Regular ArticleEfficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network☆
References (21)
- et al.
A simple parallel tree contraction algorithm
J. Algorithms
(1989) - et al.
On finding the core of a tree with a specified length
J. Algorithms
(1983) - et al.
A linear algorithm for a core of a tree
J Algorithms
(1980) - et al.
A simple optimal parallel algorithm for a core of a tree
Journal of Parallel and Distributed Computing
(1994) - et al.
Efficient algorithms for finding a core of a tree with a specified length
J Algorithms
(1996) Parallel merge sort
SIAM J. Comput.
(1988)- et al.
Approximate parallel scheduling, Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
SIAM J. Comput.
(1988) Optimum center location in simple networks
Transport. Sci.
(1971)Optimal distribution of switching centers in communication networks and some related graph theoretical problems
Oper. Res.
(1965)- et al.
Location on Networks
(1979)
Cited by (26)
Efficient algorithms for the minmax regret path center problem with length constraint on trees
2022, Theoretical Computer ScienceCitation 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 SciencesCitation 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 SciencesCitation 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 SciencesCitation 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.
Finding the conditional location of a median path on a tree
2008, Information and ComputationAlgorithms for central-median paths with bounded length on trees
2007, European Journal of Operational Research
- ☆
This research is supported by the National Science Council of the Republic of China under Grant NSC-87-2213-E-007-066.