Online algorithms for network design

Adam Meyerson
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer networks (wired and wireless) as well as many other applications. In most cases the natural applications involve changing sets of communicating nodes, making the online model essential for addressing them.
doi:10.1145/1007912.1007958 dblp:conf/spaa/Meyerson04 fatcat:eejnfip6zrcp3dmsg2radcfxse