{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:01Z","timestamp":1750307461412,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835800","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"440-449","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Online set packing and competitive scheduling of multi-part tasks"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[{"name":"Microsoft Israel R&D Center and Tel Aviv University, Herzelia, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[{"name":"Reykjavik University, Reykjavik, Iceland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_3_2_1_2_1","first-page":"16","volume-title":"Proc. 2nd APPROX","author":"Alon N.","year":"1999","unstructured":"N. Alon , U. Arad , and Y. Azar . Independent sets in hypergras with applications to routingvia fixed paths . In Proc. 2nd APPROX , pp. 16 -- 27 , 1999 . N. Alon, U. Arad, and Y. Azar. Independent sets in hypergras with applications to routingvia fixed paths. In Proc. 2nd APPROX, pp. 16--27, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080717651"},{"issue":"3","key":"e_1_3_2_1_4_1","first-page":"178","article-title":"for maximum weight independent set in d-claw free graphs","volume":"7","author":"Berman P.","year":"2000","unstructured":"P. Berman . A d\/2-approximation for maximum weight independent set in d-claw free graphs . Nordic J. Comput. , 7 ( 3 ): 178 -- 184 , 2000 . P. Berman. A d\/2-approximation for maximum weight independent set in d-claw free graphs. Nordic J. Comput., 7(3):178--184, 2000.","journal-title":"Nordic J. Comput."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0363"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00411-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00124-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161033"},{"key":"e_1_3_2_1_13_1","volume-title":"Winston & Sons","author":"Kolchin V. F.","year":"1978","unstructured":"V. F. Kolchin , B. A. Sevastyanov , and V. P. Chistyakov . Random Allocations . Winston & Sons , Washington , 1978 . V. F. Kolchin, B. A. Sevastyanov, and V. P. Chistyakov. Random Allocations. Winston & Sons, Washington, 1978."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109666"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167127"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711521"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"e_1_3_2_1_19_1","first-page":"222","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing","author":"Yao A. C.-C.","year":"1977","unstructured":"A. C.-C. Yao . Probabilistic computations : Toward a unified measure of complexity . In Proceedings of the 18th Annual ACM Symposium on Theory of Computing , pages 222 -- 227 , 1977 . A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 222--227, 1977."}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:24Z","timestamp":1750248504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":19,"alternative-id":["10.1145\/1835698.1835800","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835800","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}