{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:19:06Z","timestamp":1757542746843},"reference-count":66,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,20]]},"DOI":"10.1109\/infocom52122.2024.10621340","type":"proceedings-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T17:25:41Z","timestamp":1723483541000},"page":"1461-1470","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks"],"prefix":"10.1109","author":[{"given":"Wenkai","family":"Dai","sequence":"first","affiliation":[{"name":"University of Vienna,Faculty of Computer Science and UniVie Doctoral School Computer Science DoCS,Austria"}]},{"given":"Michael","family":"Dinitz","sequence":"additional","affiliation":[{"name":"Johns Hopkins University,Department of Computer Science,USA"}]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[{"name":"TU Dortmund,Department of Computer Science,Germany"}]},{"given":"Long","family":"Luo","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China,P.R. China"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/ConTEL.2017.8000037"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851222"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100621"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"ref6","first-page":"29","article-title":"High throughput data center topology design","author":"Singla","year":"2014","journal-title":"NSDI"},{"key":"ref7","article-title":"Stable matching algorithm for an agile reconfigurable data center interconnect (MSR-TR-2016-1140)","volume-title":"Microsoft Research, Tech. Rep.","author":"Devanur","year":"2016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3547353.3522635"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3606376.3593537"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3606376.3593551"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229050"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.10.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3336937.3336939"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155537"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461786"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737431"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102238"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3453953.3453962"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337898"},{"volume-title":"Approximation algorithms","year":"2001","author":"Vazirani","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836126"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901479"},{"year":"2018","key":"ref25","article-title":"Edge 640 optical circuit switch"},{"year":"2019","key":"ref26","article-title":"Series 6000n network optical matrix switch"},{"key":"ref27","article-title":"Firefly: a reconfigurable wireless data center fabric using free-space optics","author":"Azimi","year":"2014","journal-title":"SIGCOMM"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018442"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218407"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3366695"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-016-0190-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62592-5_80"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/net.20121"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3379486"},{"year":"2016","key":"ref40","article-title":"Characterization of the doe mini-apps"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"ref42","article-title":"Jellyfish: Networking data centers randomly","author":"Singla","year":"2012","journal-title":"NSDI"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"ref44","article-title":"Expanding across time to deliver bandwidth efficiency and low latency","author":"Mellette","year":"2020","journal-title":"NSDI"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999580"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3544216.3544265"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486007"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155537"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583410"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056969"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3335898"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3373360.3380840"},{"key":"ref57","article-title":"Chopin: Combining distributed and centralized schedulers for self-adjusting datacenter networks","author":"Schiff","year":"2022","journal-title":"OPODIS"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2022.103399"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3493425.3502753"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.78"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3369740.3369777"},{"key":"ref62","article-title":"Fast hybrid network algorithms for shortest paths in sparse graphs","author":"Feldmann","year":"2020","journal-title":"OPODIS"},{"key":"ref63","first-page":"11:1","article-title":"Near-shortest path routing in hybrid communication networks","author":"Coy","year":"2021","journal-title":"OPODIS"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405719"},{"key":"ref65","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM52122.2024.10621340","article-title":"Approximation algorithms for minimizing congestion in demand-aware networks","author":"Dai","year":"2024"},{"key":"ref66","article-title":"Brief announcement: Minimizing congestion in hybrid demand-aware network topologies","author":"Dai","year":"2022","journal-title":"DISC"}],"event":{"name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","start":{"date-parts":[[2024,5,20]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2024,5,23]]}},"container-title":["IEEE INFOCOM 2024 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10621050\/10621073\/10621340.pdf?arnumber=10621340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T05:27:28Z","timestamp":1723526848000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10621340\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":66,"URL":"https:\/\/doi.org\/10.1109\/infocom52122.2024.10621340","relation":{},"subject":[],"published":{"date-parts":[[2024,5,20]]}}}