{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:04Z","timestamp":1755880804039,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"European Research Council","doi-asserted-by":"publisher","award":["864228"],"award-info":[{"award-number":["864228"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660264","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"447-449","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9874-4795","authenticated-orcid":false,"given":"Aleksander","family":"Figiel","sequence":"first","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-8563","authenticated-orcid":false,"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7451-9401","authenticated-orcid":false,"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9213-1512","authenticated-orcid":false,"given":"Arash","family":"Pourdamghani","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin & Fraunhofer SIT, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Florian Adriaens and Aristides Gionis. 2022. Diameter Minimization by Shortcutting with Degree Constraints. In ICDM.","DOI":"10.1109\/ICDM54844.2022.00095"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Chen Avin Manya Ghobadi Chen Griner and Stefan Schmid. 2020a. On the Complexity of Traffic Traces and Implications. In ACM SIGMETRICS.","DOI":"10.1145\/3393691.3394205"},{"key":"e_1_3_2_1_3_1","volume-title":"Demand-aware network designs of bounded degree. Distributed Computing","author":"Avin Chen","year":"2020","unstructured":"Chen Avin, Kaushik Mondal, and Stefan Schmid. 2020b. Demand-aware network designs of bounded degree. Distributed Computing (2020)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Marcin Bienkowski David Fuchssteiner and Stefan Schmid. 2023. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization. In SC. ACM.","DOI":"10.1145\/3581784.3607057"},{"key":"e_1_3_2_1_5_1","volume-title":"Linear-Time Approximation for Maximum Weight Matching. J. ACM","author":"Duan Ran","year":"2014","unstructured":"Ran Duan and Seth Pettie. 2014. Linear-Time Approximation for Maximum Weight Matching. J. ACM (2014)."},{"key":"e_1_3_2_1_6_1","volume-title":"Vikram Subramanya, Yeshaiahu Fainman, George Papen, and Amin Vahdat.","author":"Farrington Nathan","year":"2011","unstructured":"Nathan Farrington, George Porter, Sivasankar Radhakrishnan, Hamid Hajabdolali Bazzaz, Vikram Subramanya, Yeshaiahu Fainman, George Papen, and Amin Vahdat. 2011. Helios: a hybrid electrical\/optical switch architecture for modular data centers. ACM SIGCOMM CCR (2011)."},{"key":"e_1_3_2_1_7_1","volume-title":"Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. arXiv preprint arXiv:2308.10579","author":"Figiel Aleksander","year":"2023","unstructured":"Aleksander Figiel, Janne H Korhonen, Neil Olver, and Stefan Schmid. 2023. Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. arXiv preprint arXiv:2308.10579 (2023)."},{"key":"e_1_3_2_1_8_1","volume-title":"Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. Information Sciences","author":"Gozzard Andrew","year":"2018","unstructured":"Andrew Gozzard, Max Ward, and Amitava Datta. 2018. Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. Information Sciences (2018)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Matthew Nance Hall Klaus-Tycho Foerster Stefan Schmid and Ramakrishnan Durairajan. 2021. A Survey of Reconfigurable Optical Networks. In OSN.","DOI":"10.1016\/j.osn.2021.100621"},{"volume-title":"Fast and heavy disjoint weighted matchings for demand-aware datacenter topologies","author":"Hanauer Kathrin","key":"e_1_3_2_1_10_1","unstructured":"Kathrin Hanauer, Monika Henzinger, Stefan Schmid, and Jonathan Trummer. 2022. Fast and heavy disjoint weighted matchings for demand-aware datacenter topologies. In IEEE INFOCOM."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Jon Kleinberg. 2000. The small-world phenomenon: an algorithmic perspective. In STOC.","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Adam Meyerson and Brian Tagiku. 2009. Minimizing Average Shortest Path Distances via Shortcut Edge Addition. In RANDOM.","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Manos Papagelis Francesco Bonchi and Aristides Gionis. 2011. Suggesting ghost edges for a smaller world. In ACM CIKM.","DOI":"10.1145\/2063576.2063952"},{"key":"e_1_3_2_1_14_1","series-title":"SIAM SDM.","volume-title":"Selecting shortcuts for a smaller world","author":"Parotsidis Nikos","unstructured":"Nikos Parotsidis, Evaggelia Pitoura, and Panayiotis Tsaparas. 2015. Selecting shortcuts for a smaller world. In SIAM SDM."},{"volume-title":"SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree","author":"Pourdamghani Arash","key":"e_1_3_2_1_15_1","unstructured":"Arash Pourdamghani, Chen Avin, Robert Sama, and Stefan Schmid. 2023. SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. In IEEE INFOCOM. IEEE."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex C Snoeren. 2015. Inside the social network's (datacenter) network. In ACM SIGCOMM CCR.","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_1_17_1","volume-title":"Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks. In OPODIS.","author":"Rozen-Schiff Neta","year":"2023","unstructured":"Neta Rozen-Schiff, Klaus-Tycho Foerster, Stefan Schmid, and David Hay. 2023. Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks. In OPODIS."},{"key":"e_1_3_2_1_18_1","volume":"198","author":"Schoone A. A.","unstructured":"A. A. Schoone, H. L. Bodlaender, and J. Van Leeuwen. 1987. Diameter increase caused by edge deletion. J. Graph Theory (1987).","journal-title":"J. Van Leeuwen."},{"key":"e_1_3_2_1_19_1","volume-title":"Robert Tappan Morris","author":"Stoica Ion","year":"2001","unstructured":"Ion Stoica, Robert Tappan Morris, David R. Karger, M. Frans Kaashoek, and Hari Balakrishnan. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM."}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:24:20Z","timestamp":1755879860000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":19,"alternative-id":["10.1145\/3626183.3660264","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660264","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}