{"date_published":"2021-01-01T00:00:00Z","status":"public","conference":{"end_date":"2021-01-13","location":"Alexandria, VA, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10"},"quality_controlled":"1","_id":"11923","scopus_import":"1","extern":"1","title":"Tight bounds for online graph partitioning","citation":{"ista":"Henzinger MH, Neumann S, Räcke H, Schmid S. 2021. Tight bounds for online graph partitioning. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2799–2818.","mla":"Henzinger, Monika H., et al. “Tight Bounds for Online Graph Partitioning.” <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2021, pp. 2799–818, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.166\">10.1137/1.9781611976465.166</a>.","short":"M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2799–2818.","chicago":"Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Tight Bounds for Online Graph Partitioning.” In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2799–2818. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.166\">https://doi.org/10.1137/1.9781611976465.166</a>.","apa":"Henzinger, M. H., Neumann, S., Räcke, H., &#38; Schmid, S. (2021). Tight bounds for online graph partitioning. In <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2799–2818). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.166\">https://doi.org/10.1137/1.9781611976465.166</a>","ama":"Henzinger MH, Neumann S, Räcke H, Schmid S. Tight bounds for online graph partitioning. In: <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:2799-2818. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.166\">10.1137/1.9781611976465.166</a>","ieee":"M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online graph partitioning,” in <i>32nd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2021, pp. 2799–2818."},"article_processing_charge":"No","publication_identifier":{"eisbn":["978-161197646-5"]},"oa_version":"Preprint","doi":"10.1137/1.9781611976465.166","type":"conference","date_updated":"2023-02-17T11:32:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"day":"01","publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2011.01017","open_access":"1"}],"page":"2799-2818","month":"01","date_created":"2022-08-18T10:31:58Z","publication_status":"published","oa":1,"abstract":[{"text":"We consider the following online optimization problem. We are given a graph G and each vertex of the graph is assigned to one of ℓ servers, where servers have capacity k and we assume that the graph has ℓ · 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.\r\n\r\nThe 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.\r\n\r\nOur main contribution is a polynomial-time randomized algorithm, that is asymptotically optimal: we derive an upper bound of O(log ℓ + log k) on its competitive ratio and show that no randomized online algorithm can achieve a competitive ratio of less than Ω(log ℓ + log k). We also settle the open problem of the achievable competitive ratio by deterministic online algorithms, by deriving a competitive ratio of Θ(ℓ log k); to this end, we present an improved lower bound as well as a deterministic polynomial-time online algorithm.\r\n\r\nOur 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.","lang":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","external_id":{"arxiv":["2011.01017"]},"year":"2021"}