{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:29Z","timestamp":1750306769097,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"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":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486177","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"204-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A constant factor approximation algorithm for the storage allocation problem"],"prefix":"10.1145","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Michael","family":"Beder","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132617"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496847"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9121-7"},{"key":"e_1_3_2_1_5_1","first-page":"27","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","volume":"25","author":"Bar-Yehuda R.","year":"1985","unstructured":"R. Bar-Yehuda and S. Even . A local-ratio theorem for approximating the weighted vertex cover problem . Annals of Discrete Mathematics , 25 : 27 -- 46 , 1985 . R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27--46, 1985.","journal-title":"Annals of Discrete Mathematics"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703423941"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645591.659952"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1210-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273343"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170208928886"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9502-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00152-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90053-5"},{"key":"e_1_3_2_1_16_1","first-page":"907","volume-title":"10th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Gergov J.","year":"1999","unstructured":"J. Gergov . Algorithms for compile-time memory optimization . In 10th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 907 -- 908 , 1999 . J. Gergov. Algorithms for compile-time memory optimization. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 907--908, 1999."},{"key":"e_1_3_2_1_17_1","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980","unstructured":"M. C. Golumbic . Algorithmic Graph Theory and Perfect Graphs . Academic Press , 1980 . M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646838.708650"}],"event":{"name":"SPAA '13: 25th 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":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486177","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486177"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":18,"alternative-id":["10.1145\/2486159.2486177","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486177","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}