A general approach to online network optimization problems

We study a wide range of online graph and network optimization problems, focusing on problems that arise in the study of connectivity and cuts in graphs. In a general online network design problem, we have a communication network known to the algorithm in advance. What is not known in advance are the bandwidth or cut demands between nodes in the network. Our results include an O(logm log n) competitive randomized algorithm for the online non-metric facility location and for a generalization of the problem called the multicast problem. In the non-metric facility location m is the number of facilities and n is the number of clients. The competitive ratio is nearly tight. We also present an O(log 2 n log k) competitive randomized algorithm for the online group Steiner problem in trees and an O(log 3 n log k) competitive randomized algorithm for the problem in general graphs, where n is the number of vertices in the graph and k is the number of groups. Finally, we design a deterministic O(log 3 n log log n) competitive algorithm for the online multi-cut problem. Our algorithms are based on a unied framework for designing online algorithms for problems involving connectivity and cuts. We rst present a general O(logm)-deterministic algorithm for generating fractional solution that satis es the online connectivity or cut demands, where m is the number of edges in the graph. This may be of independent interest for solving fractional online bandwidth allocation problems, and is applicable to the node version as well. The integral solutions are obtained by an online rounding of the fractional solution. This part of the framework is problem dependent, and applies various tools including results on the approximate max- ow min-cut for multicommodity ow, the HST method and its extensions, certain rounding techniques for dependent variables, and Racke's new hierarchical decomposition of graphs.