{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:30Z","timestamp":1767340110260,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1506\/16, 1016\/17"],"award-info":[{"award-number":["1506\/16, 1016\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ICRC Blavatnik Fund"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323180","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Emek","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[{"name":"University of Siegen, Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Vainstein","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2012.10.006"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Min-Cost Bipartite Perfect Matching with Delays","volume":"1","author":"Ashlagi Itai","year":"2017","unstructured":"Itai Ashlagi , Yossi Azar , Moses Charikar , Ashish Chiplunkar , Ofir Geri , Haim Kaplan , Rahul M. Makhijani , Yuyi Wang , and Roger Wattenhofer . 2017 . Min-Cost Bipartite Perfect Matching with Delays . In APPROX\/RANDOM. 1 : 1 -- 1 :20. Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul M. Makhijani, Yuyi Wang, and Roger Wattenhofer. 2017. Min-Cost Bipartite Perfect Matching with Delays. In APPROX\/RANDOM. 1:1--1:20.","journal-title":"APPROX\/RANDOM."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Yossi Azar Ashish Chiplunkar and Haim Kaplan. 2017. Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. In SODA. 1051--1061.   Yossi Azar Ashish Chiplunkar and Haim Kaplan. 2017. Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. In SODA. 1051--1061.","DOI":"10.1137\/1.9781611974782.67"},{"key":"e_1_3_2_1_5_1","volume-title":"Deterministic Min-Cost Matching with Delays. CoRR","author":"Azar Yossi","year":"2018","unstructured":"Yossi Azar and Amit Jacob Fanani . 2018. Deterministic Min-Cost Matching with Delays. CoRR , Vol. abs\/ 1806 .03708 ( 2018 ). Yossi Azar and Amit Jacob Fanani. 2018. Deterministic Min-Cost Matching with Delays. CoRR, Vol. abs\/1806.03708 (2018)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Yossi Azar Arun Ganesh Rong Ge and Debmalya Panigrahi. 2017. Online service with delay. In STOC. 551--563.  Yossi Azar Arun Ganesh Rong Ge and Debmalya Panigrahi. 2017. Online service with delay. In STOC. 551--563.","DOI":"10.1145\/3055399.3055475"},{"key":"e_1_3_2_1_7_1","volume-title":"A Primal-Dual Online Deterministic Algorithm for Matching with Delays. CoRR","author":"Bienkowski Marcin","year":"2018","unstructured":"Marcin Bienkowski , Artur Kraska , Hsiang-Hsuan Liu , and Pawel Schmidt . 2018. A Primal-Dual Online Deterministic Algorithm for Matching with Delays. CoRR , Vol. abs\/ 1804 .08097 ( 2018 ). Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, and Pawel Schmidt. 2018. A Primal-Dual Online Deterministic Algorithm for Matching with Delays. CoRR, Vol. abs\/1804.08097 (2018)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Marcin Bienkowski Artur Kraska and Pawel Schmidt. 2017. A Match in Time Saves Nine: Deterministic Online Matching with Delays. In WAOA. 132--146.  Marcin Bienkowski Artur Kraska and Pawel Schmidt. 2017. A Match in Time Saves Nine: Deterministic Online Matching with Delays. In WAOA. 132--146.","DOI":"10.1007\/978-3-319-89441-6_11"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Marcin Bienkowski Artur Kraska and Pawel Schmidt. 2018. Online Service with Delay on a Line. In SIROCCO.  Marcin Bienkowski Artur Kraska and Pawel Schmidt. 2018. Online Service with Delay on a Line. In SIROCCO.","DOI":"10.1007\/978-3-030-01325-7_22"},{"volume-title":"Online Computation and Competitive Analysis","author":"Borodin Allan","key":"e_1_3_2_1_10_1","unstructured":"Allan Borodin and Ran El-Yaniv . 1998. Online Computation and Competitive Analysis . Cambridge University Press . Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis .Cambridge University Press."},{"key":"e_1_3_2_1_11_1","volume-title":"Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-Hard Problems","author":"Coffman EG","year":"1996","unstructured":"EG Coffman Jr , MR Garey , and DS Johnson . 1996. Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-Hard Problems ( 1996 ), 46--93. EG Coffman Jr, MR Garey, and DS Johnson. 1996. Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-Hard Problems (1996), 46--93."},{"key":"e_1_3_2_1_12_1","unstructured":"Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI. 10--10.   Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI. 10--10."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Yuval Emek Shay Kutten and Roger Wattenhofer. 2016. Online matching: haste makes waste!. In STOC. 333--344.  Yuval Emek Shay Kutten and Roger Wattenhofer. 2016. Online matching: haste makes waste!. In STOC. 333--344.","DOI":"10.1145\/2897518.2897557"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.07.004"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579456"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800152.804907"},{"key":"e_1_3_2_1_17_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1200970"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.61"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Hartmut Klauck Danupon Nanongkai Gopal Pandurangan and Peter Robinson. 2015. Distributed Computation of Large-scale Graph Problems. In SODA. 391--410.   Hartmut Klauck Danupon Nanongkai Gopal Pandurangan and Peter Robinson. 2015. Distributed Computation of Large-scale Graph Problems. In SODA. 391--410.","DOI":"10.1137\/1.9781611973730.28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3833"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_25_1","volume-title":"Hadoop: The Definitive Guide","author":"White Tom","year":"2012","unstructured":"Tom White . 2012 . Hadoop: The Definitive Guide . O'Reilly Media, Inc. Tom White. 2012. Hadoop: The Definitive Guide. O'Reilly Media, Inc."},{"key":"e_1_3_2_1_26_1","volume-title":"Spark: Cluster Computing with Working Sets. In HotCloud. 10--10.","author":"Zaharia Matei","year":"2010","unstructured":"Matei Zaharia , Mosharaf Chowdhury , Michael J. Franklin , Scott Shenker , and Ion Stoica . 2010 . Spark: Cluster Computing with Working Sets. In HotCloud. 10--10. Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: Cluster Computing with Working Sets. In HotCloud. 10--10."}],"event":{"name":"SPAA '19: 31st 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","EATCS European Association for Theoretical Computer Science"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":26,"alternative-id":["10.1145\/3323165.3323180","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323180","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}