Oct. 13, 2015, 10:15 a.m.

Tuesday 10:15-12:00, room 310.

Abstract. In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T . A service is defined as a subtree X of T that contains its root. This subtree X services all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival and service times. The objective is to minimize the total waiting cost of all requests plus the cost of all service sub-trees. MLAP is a generalization of some well-studied optimization problems; for example, for trees of depth 1, MLAP is equivalent to the TCP Acknowledgement Problem, while for trees of depth 2, it is equivalent to the Joint Replenishment Problem. In earlier literature, the waiting cost functions are often assumed to be linear; we denote this special case by MLAP-L. The model with deadlines, denoted MLAP-D, has also been studied. Our main result is an online algorithm with competitive ratio O(D^4 2^D), where D is the depth of T . This is the first non-trivial competi- tiveness bound on trees of depth three or more, not only for MLAP but also for MLAP-D and MLAP-L. Previously constant-competitive algorithms were known only for D = 1, 2.

This is a joint work in progress with Marcin Bienkowski, Martin Böhm, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż , Jiří Sgall, Nguyen Kim Thang, and Pavel Veselý.