 
Summary: A General Approach to Online Network Optimization Problems
Noga Alon
Baruch Awerbuch
Yossi Azar
Niv Buchbinder §
Joseph (Seffi) Naor ¶
Abstract
We study a wide range of online graph and network opti
mization 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(log m log n) competi
tive randomized algorithm for the online nonmetric facility
location and for a generalization of the problem called the
multicast problem. In the nonmetric 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(log2
