Average competitive ratios of on-line spanning trees

Abstract

We study the average competitive ratio of on-line spanning trees with the same distribution of points in the Euclidean plane. We show a distribution of n points such that the average competitive ratio of on-line spanning trees by any on-line algorithm cannot be less than $\text{1}\text{4}$ In $\text{n −}\text{1}\text{2}$.