{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:05Z","timestamp":1759639085492,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312022","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"80-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Henry","family":"Lin","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frans","family":"Schalekamp","sequence":"additional","affiliation":[{"name":"The College of William and Mary, Williamsburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90236-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582752"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288122"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_1_6_1","first-page":"160","volume-title":"WiOpt","author":"Katz B.","year":"2010","unstructured":"B. Katz , M. V\u00f6lker , and D. Wagner . Energy efficient scheduling with power control for wireless networks . WiOpt , pages 160 -- 169 , May 2010 . B. Katz, M. V\u00f6lker, and D. Wagner. Energy efficient scheduling with power control for wireless networks. WiOpt, pages 160--169, May 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133156"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"T.\n      Locher P.\n      von Rickenbach and \n      R.\n      Wattenhofer\n  . \n  Sensor networks continue to puzzle: Selected open problems\n  . S. Rao M. Chatterjee P. Jayanti C. Murthy and S. Saha editors Distributed Computing and Networking volume \n  4904\n   of \n  Lecture Notes in Computer Science pages \n  25\n  --\n  38\n  . \n  Springer Berlin \/ Heidelberg 2008\n  .   T. Locher P. von Rickenbach and R. Wattenhofer. Sensor networks continue to puzzle: Selected open problems. S. Rao M. Chatterjee P. Jayanti C. Murthy and S. Saha editors Distributed Computing and Networking volume 4904 of Lecture Notes in Computer Science pages 25--38. Springer Berlin \/ Heidelberg 2008.","DOI":"10.1007\/978-3-540-77444-0_3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1963635.1963641"}],"event":{"name":"SPAA '12: 24th 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":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312022","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312022"}},"subtitle":["on the complexity of the minimum latency scheduling problem on the euclidean plane"],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":9,"alternative-id":["10.1145\/2312005.2312022","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312022","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}