𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Scribed by Francis Suraweera; Prabir Bhattacharya

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
481 KB
Volume
45
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

An algorithm to solve the m Γ— n assignme
An algorithm to solve the m Γ— n assignment problem in expected time O(mn log n)
✍ Richard M. Karp πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The