Tight bounds for online graph partitioning

Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

11 Zitate (Scopus)

Abstract

We consider the following online optimization problem. We are given a graph G and each vertex of the graph is assigned to one of l servers, where servers have capacity k and we assume that the graph has l · k vertices. Initially, G does not contain any edges and then the edges of G are revealed one-by-one. The goal is to design an online algorithm ONL, which always places the connected components induced by the revealed edges on the same server and never exceeds the server capacities by more than εk for constant ε > 0. Whenever ONL learns about a new edge, the algorithm is allowed to move vertices from one server to another. Its objective is to minimize the number of vertex moves. More specifically, ONL should minimize the competitive ratio: the total cost ONL incurs compared to an optimal offline algorithm OPT. The problem was recently introduced by Henzinger et al. (SIGMETRICS'2019) and is related to classic online problems such as online paging and scheduling. It finds applications in the context of resource allocation in the cloud and for optimizing distributed data structures such as union-find data structures. Our main contribution is a polynomial-time randomized algorithm, that is asymptotically optimal: we derive an upper bound of O(log l + log k) on its competitive ratio and show that no randomized online algorithm can achieve a competitive ratio of less than Ω(log l + log k). We also settle the open problem of the achievable competitive ratio by deterministic online algorithms, by deriving a competitive ratio of Θ(llog k); to this end, we present an improved lower bound as well as a deterministic polynomial-time online algorithm. Our algorithms rely on a novel technique which combines efficient integer programming with a combinatorial approach for maintaining ILP solutions. More precisely, we use an ILP to assign the connected components induced by the revealed edges to the servers; this is similar to existing approximation schemes for scheduling algorithms. However, we cannot obtain our competitive ratios if we run the ILP after each edge insertion. Instead, we identify certain types of edge insertions, after which we can manually obtain an optimal ILP solution at zero cost without resolving the ILP. We believe this technique is of independent interest and will find further applications in the future.

OriginalspracheEnglisch
TitelACM-SIAM Symposium on Discrete Algorithms, SODA 2021
Redakteure/-innenDaniel Marx
Herausgeber (Verlag)Association for Computing Machinery
Seiten2799-2818
Seitenumfang20
ISBN (elektronisch)9781611976465
PublikationsstatusVeröffentlicht - 2021
Veranstaltung32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 - Alexandria, Virtual, USA/Vereinigte Staaten
Dauer: 10 Jan. 202113 Jan. 2021

Publikationsreihe

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Konferenz

Konferenz32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021
Land/GebietUSA/Vereinigte Staaten
OrtAlexandria, Virtual
Zeitraum10/01/2113/01/21

Fingerprint

Untersuchen Sie die Forschungsthemen von „Tight bounds for online graph partitioning“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren