Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 4
Cited 0

Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM Journal on Computing
Parallel merge sort

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
Efficient algorithms for finding a core of a tree with a specified length

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a weighted tree network a tree-shaped facility of a specified length. Two optimization criteria are considered: minimum eccentricity and minimum distancesum. Let n be the number of vertices in the tree network. Both the two algorithms we shall propose take O(log nloglog n) time using O(n) work.