𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rate of convergence for the Euclidean minimum spanning tree limit law

✍ Scribed by Patrick Jaillet

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
353 KB
Volume
14
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A hierarchy of hop-indexed models for th
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
✍ Gouveia, Luis; Martins, Pedro πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

Worst-case behavior of the MVCA heuristi
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
✍ Yupei Xiong; Bruce Golden; Edward Wasil πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 185 KB

In this paper, we review recent work on the minimum labeling spanning tree problem and obtain a new worst-case ratio for the MVCA heuristic. We also present a family of graphs in which the worst-case ratio can be attained. This implies that the new ratio cannot be improved any further.