An O(logn)-Competitive Algorithm for Online Constrained Forest Problems

@inproceedings{Qian2011AnOA,
  title={An O(logn)-Competitive Algorithm for Online Constrained Forest Problems},
  author={Jiawei Qian and David P. Williamson},
  booktitle={ICALP},
  year={2011}
}
In the generalized Steiner tree problem, we find a minimumcost set of edges to connect a given set of source-sink pairs. In the online version of this problem, the source-sink pairs arrive over time. Agrawal, Klein, and Ravi [1] give a 2-approximation algorithm for the offline problem; Berman and Coulston [3] give an O(logn)-competitive algorithm for the online problem. Goemans and Williamson [4] subsequently generalized the offline algorithm of Agrawal et al. to handle a large class of… CONTINUE READING