On an Online Spanning Tree Problem in Randomly Weighted Graphs

This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weights are uniformly distributed over [0,1]. An algorithm receives the edges one by one and has to decide immediately whether to include the current edge into the spanning tree or to reject it. The corresponding edge sequence is determined by some adversary. We propose an algorithm which achieves $\mathbb{E}[ALG]/\mathbb{E}[OPT]=O(1)$ and $\mathbb{E}[ALG/OPT]=O(1)$ against a fair adaptive adversary, i.e., an adversary which determines the edge order online and is fair in a sense that he does not know more about the edge weights than the algorithm. Furthermore, we prove that no online algorithm performs better than $\mathbb{E}[ALG]/\mathbb{E}[OPT]=\Omega(\log n)$ if the adversary knows the edge weights in advance. This lower bound is tight, since there is an algorithm which yields $\mathbb{E}[ALG]/\mathbb{E}[OPT]=O(\log n)$ against the strongest-imaginable adversary.

[1]  Torben Hagerup.  Simpler Computation of Single-Source Shortest Paths in Linear Average Time , 2005, Theory of Computing Systems.

[2]  Svante Janson,et al.  The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph , 1995, Random Struct. Algorithms.

[3]  Edward G. Coffman,et al.  On the Expected Relative Performance of List Scheduling , 1985, Oper. Res..

[4]  Alan M. Frieze,et al.  Random Minimum Length Spanning Trees in Regular Graphs , 1998, Comb..

[5]  Alexander Souza,et al.  The Expected Competitive Ratio for Weighted Completion Time Scheduling , 2004, STACS.

[6]  C. McDiarmid,et al.  On random minimum length spanning trees , 1989 .

[7]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[8]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[9]  Alan M. Frieze,et al.  A Note on Random Minimum Length Spanning Trees , 2000, Electron. J. Comb..

[10]  Alan M. Frieze,et al.  Algorithmic theory of random graphs , 1997, Random Struct. Algorithms.

[11]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Seth Pettie,et al.  An optimal minimum spanning tree algorithm , 2000, JACM.

[14]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[15]  Robert E. Tarjan,et al.  Linear Expected-Time Algorithms for Connectivity Problems , 1980, J. Algorithms.

[16]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[17]  Colin McDiarmid,et al.  On finding a minimum spanning tree in a network with random weights , 1997 .

[18]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .