{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:48:07Z","timestamp":1783036087906,"version":"3.54.6"},"reference-count":55,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796921","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1649-1658","source":"Crossref","is-referenced-by-count":10,"title":["Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies"],"prefix":"10.1109","author":[{"given":"Kathrin","family":"Hanauer","sequence":"first","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Trummer","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_24"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_9"},{"key":"ref33","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","author":"gabow","year":"1990","journal-title":"SODA 1990"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65954"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0215009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2736283"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115366"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"ref27","article-title":"Implementation of algorithms for maximum matching on nonbipartite graphs","author":"gabow","year":"1974","journal-title":"Ph D Dissertation"},{"key":"ref29","author":"lawler","year":"1976","journal-title":"Combinatorial Optimization Networks and Matroids"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_39"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.014"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/070683933"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","article-title":"A constructive proof of Vizing’s theorem","volume":"41","author":"misra","year":"1992","journal-title":"Inf Process Lett"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_47"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90209-E"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00393-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851222"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"ref17","article-title":"Optimal oblivious reconfigurable networks","author":"amir","year":"2021","journal-title":"CoRR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999580"},{"key":"ref6","article-title":"A survey of reconfigurable optical networks","author":"hall","year":"2021","journal-title":"Optical Switching and Networking (OSN)"},{"key":"ref5","first-page":"225","article-title":"Jellyfish: Networking data centers randomly","author":"singla","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3489048.3522635"},{"key":"ref7","article-title":"Gemini: Practical reconfigurable datacenter networks with topology and traffic engineering","author":"zhang","year":"2021","journal-title":"CoRR"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/0210055"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/15M1026304"},{"key":"ref45","article-title":"Approximate generalized matching: f-factors and f-edge covers","author":"huang","year":"2017","journal-title":"CoRR"},{"key":"ref48","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"vizing","year":"1964","journal-title":"Discr Analiz"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/3453953.3453976","article-title":"Online dynamic b-matching: With applications to reconfigurable datacenter networks","volume":"48","author":"bienkowski","year":"2020","journal-title":"ACM SIGMETRICS Perform Evaluation Review"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0002-8"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_19"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_48"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3183369"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796921.pdf?arnumber=9796921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T20:46:54Z","timestamp":1658177214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796921","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}