{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:14Z","timestamp":1750307894388,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T00:00:00Z","timestamp":1219017600000},"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":[[2008,8,18]]},"DOI":"10.1145\/1400863.1400877","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T12:38:39Z","timestamp":1219149519000},"page":"65-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetric range assignment with disjoint MST constraints"],"prefix":"10.1145","author":[{"given":"Eric","family":"Schmutz","sequence":"first","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01194923"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-5275-x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005773"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/647319.721012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-006-4466-8"},{"key":"e_1_3_2_1_6_1","volume-title":"II (Proc. Conf.","author":"Clausen J.","year":"1979","unstructured":"J. Clausen and L. A. Hansen . Finding k edge-disjoint spanning trees of minimum total weight in a network: an application of matroid theory. Math. Programming Stud., (13):88--101, 1980. Combinatorial optimization , II (Proc. Conf. , Univ. East Anglia, Norwich , 1979 ). J. Clausen and L. A. Hansen. Finding k edge-disjoint spanning trees of minimum total weight in a network: an application of matroid theory. Math. Programming Stud., (13):88--101, 1980. Combinatorial optimization, II (Proc. Conf., Univ. East Anglia, Norwich, 1979)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MONE.0000013624.32948.87"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v52:4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90031-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.939016"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034968141"},{"key":"e_1_3_2_1_12_1","first-page":"423","volume-title":"LATIN","author":"Kortsarz G.","year":"2008","unstructured":"G. Kortsarz , V. S. Mirrokni , Z. Nutov , and E. Tsanko . Approximating minimum-power degree and connectivity problems . In LATIN , pages 423 -- 435 , 2008 . G. Kortsarz, V. S. Mirrokni, Z. Nutov, and E. Tsanko. Approximating minimum-power degree and connectivity problems. In LATIN, pages 423--435, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046430.1046433"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293049"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625335"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.701"},{"key":"e_1_3_2_1_17_1","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970029","volume-title":"Probability theory and combinatorial optimization","author":"Steele J. M.","year":"1997","unstructured":"J. M. Steele . Probability theory and combinatorial optimization , volume 69 of CBMS-NSF Regional Conference Series in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA , 1997 . J. M. Steele. Probability theory and combinatorial optimization, volume 69 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997."}],"event":{"name":"PODC '08: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Toronto Canada","acronym":"PODC '08"},"container-title":["Proceedings of the fifth international workshop on Foundations of mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400863.1400877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1400863.1400877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:24Z","timestamp":1750258044000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400863.1400877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,18]]},"references-count":17,"alternative-id":["10.1145\/1400863.1400877","10.1145\/1400863"],"URL":"https:\/\/doi.org\/10.1145\/1400863.1400877","relation":{},"subject":[],"published":{"date-parts":[[2008,8,18]]},"assertion":[{"value":"2008-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}