Optimally locating a structured facility of a specified length in a weighted tree network

Shan-Chyun Ku; Biing-Feng Wang

doi:10.1109&#x2f;IPPS.1998.669942

Back

Conference paper

Optimally locating a structured facility of a specified length in a weighted tree network

Shan-Chyun Ku and Biing-Feng Wang

Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998, Vol.1998-March, pp.370-374

1998

DOI: https://doi.org/10.1109/IPPS.1998.669942

Abstract

EREW PRAM

Hardware and Architecture,Computer Networks and Communications

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 distance sum. Let n be the number of vertices in the tree network. Both algorithms take O(log nloglog n) time using O(n) work.

Metrics

1 Record Views

Details

Title: Optimally locating a structured facility of a specified length in a weighted tree network
Translated title: Optimally locating a structured facility of a specified length in a weighted tree network
Creators - without role: Shan-Chyun Ku - Dept. of Comput. Sci. , Nat. Tsing Hua Univ.
Biing-Feng Wang - Dept. of Comput. Sci. , Nat. Tsing Hua Univ.
Identifiers: 0818684038; 9780818684036; 0818684046; 9957776948206774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Conference paper
Publication Details: Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998, Vol.1998-March, pp.370-374

Optimally locating a structured facility of a specified length in a weighted tree network

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media