Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem

Abstract

We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied continuous problem of the Rectilinear Steiner Arborescence ($\text{RSA}$). We improve the lower bound and the upper bound on the competitive ratio for $\text{RSA}$ from $O(\log N)$ and $\varOmega (\sqrt{\log N})$ to $\varTheta (\frac{\log N}{\log \log N})$, where N is the number of Steiner points. This separates the competitive ratios of $\text{RSA}$ and the Symetric-$\text{RSA}$ $(\text{SRSA})$, two problems for which the bounds of Berman and Coulston is STOC 1997 were identical. The second problem is one of the Multimedia Content Distribution problems presented by Papadimitriou et al. in several papers and Charikar et al. SODA 1998. It can be viewed as the discrete counterparts (or a network counterpart) of $\text{RSA}$. For this second problem we present tight bounds also in terms of the network size, in addition to presenting tight bounds in terms of the number of Steiner points (the latter are similar to those we derived for $\text{RSA}$).

E. Kantor– in a part by NSF Awards 0939370-CCF, CCF-1217506 and CCF-AF-0937274 and AFOSR FA9550-13-1-0042.

S. Kutten–Supported in part by the ISF, Israeli ministry of science and by the Technion Gordon Center.