{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:01:40Z","timestamp":1780074100983,"version":"3.54.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030927011","type":"print"},{"value":"9783030927028","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92702-8_14","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:00:24Z","timestamp":1641016824000},"page":"224-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved Analysis of\u00a0Online Balanced Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4796-7422","authenticated-orcid":false,"given":"Martin","family":"B\u00f6hm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-0053","authenticated-orcid":false,"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Rothvo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3658-4848","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1169-7934","authenticated-orcid":false,"given":"Pavel","family":"Vesel\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006). https:\/\/doi.org\/10.1007\/s00224-006-1350-7","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1137\/17M1158513","volume":"34","author":"C Avin","year":"2020","unstructured":"Avin, C., Bienkowski, M., Loukas, A., Pacut, M., Schmid, S.: Dynamic balanced graph partitioning. SIAM J. Disc. Math. 34(3), 1791\u20131812 (2020). https:\/\/doi.org\/10.1137\/17M1158513","journal-title":"SIAM J. Disc. Math."},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: Proceedings 30th International Symposium on Distributed Computing (DISC), pp. 243\u2013256 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_18","DOI":"10.1007\/978-3-662-53426-7_18"},{"key":"14_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Chowdhury, M., Zaharia, M., Ma, J., Jordan, M.I., Stoica, I.: Managing data transfers in computer clusters with Orchestra. In: ACM SIGCOMM, pp. 98\u2013109 (2011). https:\/\/doi.org\/10.1145\/2018436.2018448","DOI":"10.1145\/2018436.2018448"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1968802","volume":"43","author":"P Erd\u0151s","year":"1942","unstructured":"Erd\u0151s, P.: On an elementary proof of some asymptotic formulas in the theory of partitions. Ann. Math. 43(3), 437\u2013450 (1942). https:\/\/doi.org\/10.2307\/1968802","journal-title":"Ann. Math."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Neumann, S., R\u00e4cke, H., Schmid, S.: Tight bounds for online graph partitioning. In: Proceedings of 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2799\u20132818 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.166","DOI":"10.1137\/1.9781611976465.166"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Neumann, S., Schmid, S.: Efficient distributed workload (re-)embedding. In: 2019 SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems, pp. 43\u201344 (2019). https:\/\/doi.org\/10.1145\/3309697.3331503","DOI":"10.1145\/3309697.3331503"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"R Krauthgamer","year":"2006","unstructured":"Krauthgamer, R., Feige, U.: A polylogarithmic approximation of the minimum bisection. SIAM Rev. 48(1), 99\u2013130 (2006). https:\/\/doi.org\/10.1137\/050640904","journal-title":"SIAM Rev."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","DOI":"10.4171\/093"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Pacut, M., Parham, M., Schmid, S.: Brief announcement: deterministic lower bound for dynamic balanced graph partitioning. In: Proceedings 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 461\u2013463 (2020). https:\/\/doi.org\/10.1145\/3382734.3405696","DOI":"10.1145\/3382734.3405696"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Pacut, M., Parham, M., Schmid, S.: Optimal online balanced graph partitioning. In: Proceedings 40th IEEE International Conference on Computer Communications (INFOCOM), pp. 1\u20139 (2021). https:\/\/doi.org\/10.1109\/INFOCOM42981.2021.9488824","DOI":"10.1109\/INFOCOM42981.2021.9488824"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of 40th ACM Symposium on Theory of Computing (STOC), pp. 255\u2013264 (2008). https:\/\/doi.org\/10.1145\/1374376.1374415","DOI":"10.1145\/1374376.1374415"},{"key":"14_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Hoboken (1998)"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). https:\/\/doi.org\/10.1145\/2786.2793","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92702-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:23:20Z","timestamp":1641018200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92702-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030927011","9783030927028"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92702-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/WAOA2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}