{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:50:26Z","timestamp":1778496626009,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft Research Training Group 2434 Facets of Complexity","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461807","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"232-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficiency and Stability in Euclidean Network Design"],"prefix":"10.1145","author":[{"given":"Wilhelm","family":"Friedemann","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Gawendowicz","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Melnichenko","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jannik","family":"Peters","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Stephan","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Vaichenker","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, University of Potsdam, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109568"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.754800"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771478"},{"key":"e_1_3_2_1_4_1","volume-title":"Network creation games: Structure vs anarchy. arXiv:1706.09132","author":"\u00c0lvarez C.","year":"2017","unstructured":"C. \u00c0lvarez and A. Messegu\u00e9 . Network creation games: Structure vs anarchy. arXiv:1706.09132 , 2017 . C. \u00c0lvarez and A. Messegu\u00e9. Network creation games: Structure vs anarchy. arXiv:1706.09132, 2017."},{"key":"e_1_3_2_1_5_1","volume-title":"On the constant price of anarchy conjecture. arXiv:1809.08027","author":"\u00c0lvarez C.","year":"2018","unstructured":"C. \u00c0lvarez and A. Messegu\u00e9 . On the constant price of anarchy conjecture. arXiv:1809.08027 , 2018 . C. \u00c0lvarez and A. Messegu\u00e9. On the constant price of anarchy conjecture. arXiv:1809.08027, 2018."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35389-6_23"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00155"},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"STACS'18","author":"Bil\u00f2 D.","year":"2018","unstructured":"D. Bil\u00f2 and P. Lenzner . On the tree conjecture for the network creation game . In STACS'18 , pages 14: 1 -- 14 :15, 2018 . D. Bil\u00f2 and P. Lenzner. On the tree conjecture for the network creation game. In STACS'18, pages 14:1--14:15, 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Selfish creation of social networks. CoRR, abs\/2012.06203","author":"Bil\u00f2 D.","year":"2020","unstructured":"D. Bil\u00f2 , T. Friedrich , P. Lenzner , S. Lowski , and A. Melnichenko . Selfish creation of social networks. CoRR, abs\/2012.06203 , 2020 . D. Bil\u00f2, T. Friedrich, P. Lenzner, S. Lowski, and A. Melnichenko. Selfish creation of social networks. CoRR, abs\/2012.06203, 2020."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323199"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"FSTTCS'20","author":"Bil\u00f2 D.","year":"2020","unstructured":"D. Bil\u00f2 , T. Friedrich , P. Lenzner , A. Melnichenko , and L. Molitor . Fair tree connection games with topology-dependent edge cost . In FSTTCS'20 , pages 15: 1 -- 15 :15, 2020 . D. Bil\u00f2, T. Friedrich, P. Lenzner, A. Melnichenko, and L. Molitor. Fair tree connection games with topology-dependent edge cost. In FSTTCS'20, pages 15:1--15:15, 2020."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24829-0_21"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.06.010"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66700-3_13"},{"key":"e_1_3_2_1_17_1","first-page":"141","volume-title":"SAGT'16","author":"Chauhan A.","year":"2016","unstructured":"A. Chauhan , P. Lenzner , A. Melnichenko , and M. M\u00fc nn. On selfish creation of robust networks . In SAGT'16 , pages 141 -- 152 , 2016 . A. Chauhan, P. Lenzner, A. Melnichenko, and M. M\u00fc nn. On selfish creation of robust networks. In SAGT'16, pages 141--152, 2016."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3199607"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9128-8"},{"key":"e_1_3_2_1_20_1","first-page":"854","volume-title":"SODA'08","author":"Chen H.","year":"2008","unstructured":"H. Chen , T. Roughgarden , and G. Valiant . Designing networks with good equilibria . In SODA'08 , pages 854 -- 863 , 2008 . H. Chen, T. Roughgarden, and G. Valiant. Designing networks with good equilibria. In SODA'08, pages 854--863, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48054-0_21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0098"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2151171.2151176"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-005-4468-y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/140979538"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872088"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1210678"},{"key":"e_1_3_2_1_29_1","volume-title":"Efficiency and stability in euclidean network design. arXiv:2104.11618","author":"Friedemann W.","year":"2021","unstructured":"W. Friedemann , T. Friedrich , H. Gawendowicz , P. Lenzner , A. Melnichenko , J. Peters , D. Stephan , and M. Vaichenker . Efficiency and stability in euclidean network design. arXiv:2104.11618 , 2021 . W. Friedemann, T. Friedrich, H. Gawendowicz, P. Lenzner, A. Melnichenko, J. Peters, D. Stephan, and M. Vaichenker. Efficiency and stability in euclidean network design. arXiv:2104.11618, 2021."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66700-3_16"},{"key":"e_1_3_2_1_31_1","first-page":"226","volume-title":"APPROX\/RANDOM'14","author":"Gairing M.","year":"2014","unstructured":"M. Gairing , T. Harks , and M. Klimm . Complexity and approximation of the continuous network design problem . In APPROX\/RANDOM'14 , pages 226 -- 241 , 2014 . M. Gairing, T. Harks, and M. Klimm. Complexity and approximation of the continuous network design problem. In APPROX\/RANDOM'14, pages 226--241, 2014."},{"key":"e_1_3_2_1_32_1","volume-title":"Computers and intractability","author":"Garey M. R.","year":"2002","unstructured":"M. R. Garey and D. S. Johnson . Computers and intractability , volume 29 . wh freeman New York , 2002 . M. R. Garey and D. S. Johnson. Computers and intractability, volume 29. wh freeman New York, 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms8651"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2010.06.001"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9014-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_19"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486185"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00069"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24829-0_23"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_11"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.18.1.1"},{"key":"e_1_3_2_1_45_1","volume-title":"Mihal\u00e1 k, and D. M\u00fc ller. Tree Nash equilibria in the network creation game. Internet Mathematics, 11(4--5):472--486","author":"Mamageishvili A.","year":"2015","unstructured":"A. Mamageishvili , M. Mihal\u00e1 k, and D. M\u00fc ller. Tree Nash equilibria in the network creation game. Internet Mathematics, 11(4--5):472--486 , 2015 . A. Mamageishvili, M. Mihal\u00e1 k, and D. M\u00fc ller. Tree Nash equilibria in the network creation game. Internet Mathematics, 11(4--5):472--486, 2015."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_60"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9459-y"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9398-9"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1208237"},{"key":"e_1_3_2_1_51_1","volume-title":"an introduction","author":"Newman M.","year":"2010","unstructured":"M. Newman . Networks : an introduction . Oxford university press , 2010 . M. Newman. Networks: an introduction. Oxford university press, 2010."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '21","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"]},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":51,"alternative-id":["10.1145\/3409964.3461807","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461807","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}