Distributed algorithm for finding a core of a tree network
A core of a graph G = (V, E) is a path P in G which minimizes d(P)=∑ v∈V d(v, P) where d(v,P) is the distance of vertex v from P. Finding a core of a network is essential in locating the best sites to set up service facilities. Here we present the first distributed algorithm which finds a core of a tree network in O(D) time using O(n) messages, where D and n are the diameter and the number of vertices of G respectively.
Keywordstree location problem core distributed algorithm
Unable to display preview. Download preview PDF.
- 1.Albacea, E. A.: Parallel algorithm for finding a core of a tree network. Information Processing Letters 51 (1994) 223–226Google Scholar
- 2.Bar-Ilan, J., Peleg, D.: Approximation algorithms for selecting network centers. Workshop on Algorithms and Data Structures (1991) 343–354Google Scholar
- 3.Hakim, S. L.: Optimal distribution of switching centers in a communication network and some related graph theoretical problems. Opns. Res. 13 (1965) 462–475Google Scholar
- 4.Korach, E.: Distributed algorithms for finding centers and medians in networks. ACM Trans. on Programming Languages and Systems 6(3) (1984) 380–401Google Scholar
- 5.Minieka, E., Patel, N. H.: On finding the core of a tree with a specified length. J. Algorithms 4 (1983) 345–352Google Scholar
- 6.Morgan, C. A., Slater, P. J.: A linear algorithm for a core of a tree. J. Algorithms. 1 (1980) 247–258Google Scholar
- 7.Peng, S., Lo, W.: A simple optimal parallel algorithm for a core of a tree. J. of Parallel and Distributed Computing 20 (1994) 388–392Google Scholar
- 8.Shier, D. R.: A min-max theorem for p-center problems on a tree. Transportation Sci. 11 (1977) 243–252Google Scholar
- 9.Slater, P. J.: Locating central paths in a graph. Transportation Sci. 16 (1982) 1–18Google Scholar