论文信息 - Average Competitive Ratios of On-Line Spanning Trees

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 1 4 In n − 1 2 .

Yoshihide Igarashi | Feng Bao | Aohan Mei

[1] Yuval Rabani,et al. Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[2] Chuan Yi Tang,et al. The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems , 1993, Inf. Process. Lett..

[3] Noga Alon,et al. On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[4] Makoto Imase,et al. Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..