𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient computation of 2-medians in a tree network with positive/negative weights

✍ Scribed by Robert Benkoczi; B.K. Bhattacharya; D. Breton

Book ID
108113597
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
277 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Parallel Algorithms for Optima
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
✍ Biing-Feng Wang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 128 KB

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 ecce