{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:23Z","timestamp":1750306163898,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935777","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"455-466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford"],"prefix":"10.1145","author":[{"given":"Stephan","family":"Friedrichs","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Lenzen","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1388"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796341"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v30:4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312045"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810535"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331610"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.016"},{"volume-title":"MIT Press","year":"2009","author":"Cormen T. H.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_2_1_18_1","unstructured":"L. R. Ford. Network flow theory. 1956.  L. R. Ford. Network flow theory. 1956."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_14"},{"key":"e_1_3_2_1_20_1","unstructured":"M. Hauptmann and M. Karpinski. A compendium on Steiner tree problems. http:\/\/theory.cs.uni-bonn.de\/info5\/steinerkompendium\/netcompendium.html. Visited 2016-05--12.  M. Hauptmann and M. Karpinski. A compendium on Steiner tree problems. http:\/\/theory.cs.uni-bonn.de\/info5\/steinerkompendium\/netcompendium.html. Visited 2016-05--12."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0157-9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488656"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611464"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767398"},{"key":"e_1_3_2_1_26_1","first-page":"2009","article-title":"Fast C-K-R partitions of sparse graphs","author":"Mendel M.","year":"2009","journal-title":"Chicago Journal of Theoretical Computer Science"},{"issue":"3","key":"e_1_3_2_1_27_1","first-page":"321","article-title":"Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata","volume":"7","author":"Mohri M.","year":"2002","journal-title":"Languages and Combinatorics"},{"key":"e_1_3_2_1_28_1","first-page":"87","volume-title":"Symposium on the Theory of Switching","author":"Moore E. F.","year":"1959"},{"volume-title":"SIAM","year":"2000","author":"Peleg D.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/567112.567114"}],"event":{"name":"SPAA '16: 28th 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"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935777","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:56Z","timestamp":1750217996000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":30,"alternative-id":["10.1145\/2935764.2935777","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935777","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}