{"id":"https://openalex.org/W3048797432","doi":"https://doi.org/10.1137/17m1158513","title":"Dynamic Balanced Graph Partitioning","display_name":"Dynamic Balanced Graph Partitioning","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3048797432","doi":"https://doi.org/10.1137/17m1158513","mag":"3048797432"},"language":"en","primary_location":{"id":"doi:10.1137/17m1158513","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158513","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/281089","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010846539","display_name":"Chen Avin","orcid":"https://orcid.org/0000-0002-6647-8002"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chen Avin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045471772","display_name":"Marcin Bie\u0144kowski","orcid":"https://orcid.org/0000-0002-2453-7772"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcin Bienkowski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033465803","display_name":"Andreas Loukas","orcid":"https://orcid.org/0000-0003-4866-1599"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas Loukas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046854190","display_name":"Maciej Pacut","orcid":"https://orcid.org/0000-0002-6379-1490"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maciej Pacut","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5010846539"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4577,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83672883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"3","first_page":"1791","last_page":"1812"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6988029479980469},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6410596966743469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5905276536941528},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5814117193222046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5026998519897461},{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.490092396736145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4861316382884979},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.47858190536499023},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4739901125431061},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4293588101863861},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4278488755226135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3818895220756531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3608604669570923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33737343549728394},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2957614064216614},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08618423342704773}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6988029479980469},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6410596966743469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5905276536941528},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5814117193222046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5026998519897461},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.490092396736145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4861316382884979},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.47858190536499023},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4739901125431061},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4293588101863861},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4278488755226135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3818895220756531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3608604669570923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33737343549728394},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2957614064216614},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08618423342704773},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/17m1158513","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158513","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:infoscience.epfl.ch:281089","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/281089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:281089","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/281089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"research article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1273794976","display_name":null,"funder_award_id":"2016/23/N/ST6/03412","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G4058268884","display_name":null,"funder_award_id":"2016/22/E/ST6/00499","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G5043750247","display_name":null,"funder_award_id":"I-1245-407.6/2014","funder_id":"https://openalex.org/F4320320947","funder_display_name":"German-Israeli Foundation for Scientific Research and Development"}],"funders":[{"id":"https://openalex.org/F4320320947","display_name":"German-Israeli Foundation for Scientific Research and Development","ror":"https://ror.org/00tntzp09"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1971758446","https://openalex.org/W1972442117","https://openalex.org/W1977360022","https://openalex.org/W1981114903","https://openalex.org/W1981984261","https://openalex.org/W1998843748","https://openalex.org/W2001850337","https://openalex.org/W2007513370","https://openalex.org/W2022490362","https://openalex.org/W2030087828","https://openalex.org/W2041645394","https://openalex.org/W2043520568","https://openalex.org/W2054033098","https://openalex.org/W2058506754","https://openalex.org/W2065641139","https://openalex.org/W2069985946","https://openalex.org/W2083392624","https://openalex.org/W2088844265","https://openalex.org/W2092340542","https://openalex.org/W2122466336","https://openalex.org/W2129027842","https://openalex.org/W2151334846","https://openalex.org/W2157790661","https://openalex.org/W2272158670","https://openalex.org/W2280458302","https://openalex.org/W2953006409","https://openalex.org/W3023405701","https://openalex.org/W3137684744","https://openalex.org/W4235678009","https://openalex.org/W4251459357"],"related_works":["https://openalex.org/W2617423316","https://openalex.org/W2168823865","https://openalex.org/W1602169857","https://openalex.org/W1979064639","https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W2087343661","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2058681277"],"abstract_inverted_index":{"This":[0],"paper":[1],"initiates":[2],"the":[3,6,34,44,61,85,175,187],"study":[4],"of":[5,20,50,87,124,155],"classic":[7],"balanced":[8],"graph":[9],"partitioning":[10,43,65],"problem":[11,94],"from":[12],"an":[13,17,168],"online":[14,80,101,111,122,149],"perspective:":[15],"Given":[16],"arbitrary":[18],"sequence":[19],"pairwise":[21],"communication":[22,89],"requests":[23,40],"between":[24,73],"$n$":[25],"nodes,":[26],"with":[27,106,115,137,160,178],"patterns":[28],"that":[29,54,146],"may":[30],"change":[31],"over":[32],"time,":[33],"objective":[35],"is":[36,77],"to":[37,78,98],"service":[38],"these":[39],"efficiently":[41],"by":[42,70],"nodes":[45,57,72],"into":[46],"$L$":[47],"clusters,":[48],"each":[49],"size":[51],"$k$,":[52,158],"such":[53],"frequently":[55],"communicating":[56],"are":[58,167],"located":[59],"in":[60],"same":[62],"cluster.":[63],"The":[64,75,93],"can":[66],"be":[67],"updated":[68],"dynamically":[69],"migrating":[71],"clusters.":[74],"goal":[76],"devise":[79],"algorithms":[81,133],"which":[82],"jointly":[83],"minimize":[84],"amount":[86],"intercluster":[88],"and":[90,113,132,138,181],"migration":[91],"cost.":[92],"features":[95],"interesting":[96],"connections":[97],"other":[99],"well-known":[100],"problems.":[102],"For":[103],"example,":[104],"scenarios":[105,114],"$L":[107],"=":[108,117],"2$":[109,118],"generalize":[110],"paging,":[112],"$k":[116],"constitute":[119],"a":[120,152,182],"novel":[121],"variant":[123],"maximum":[125,188],"matching.":[126],"We":[127],"present":[128],"several":[129],"lower":[130],"bounds":[131],"for":[134,174,186],"settings":[135],"both":[136],"without":[139],"cluster-size":[140],"augmentation.":[141,162],"In":[142],"particular,":[143],"we":[144],"prove":[145],"any":[147],"deterministic":[148,172],"algorithm":[150,173,185],"has":[151],"competitive":[153,184],"ratio":[154],"at":[156],"least":[157],"even":[159],"significant":[161],"Our":[163],"main":[164],"algorithmic":[165],"contributions":[166],"$O(k":[169],"\\log":[170],"k)$-competitive":[171],"general":[176],"setting":[177],"constant":[179,183],"augmentation":[180],"matching":[189],"variant.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-10-10T00:00:00"}