{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:23Z","timestamp":1750307303113,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989538","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"269-278","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On a local protocol for concurrent file transfers"],"prefix":"10.1145","author":[{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"first","affiliation":[{"name":"University of Maryland at College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[{"name":"IBM T.J.Watson Research Center, Hawthorne, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[{"name":"Rutgers University-Camden, Camden, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Graph Theory.Graduate Texts in Mathematics, 244","author":"Bondy J.A.","year":"2008","unstructured":"J.A. Bondy and U. S.R. Murty . Graph Theory.Graduate Texts in Mathematics, 244 . Springer , New York , 2008 . J.A. Bondy and U.S.R. Murty. Graph Theory.Graduate Texts in Mathematics, 244. Springer, New York, 2008."},{"key":"e_1_3_2_1_2_1","volume-title":"Min Sum Edge Coloring in Multigraphs Via Configuration LP.In Proc. 13th Conf. Integer Prog. Combin. Optimiz. (IPCO)","author":"Halld\u00f3rsson M.M.","year":"2008","unstructured":"M.M. Halld\u00f3rsson , G. Kortsarz and M. Sviridenko . Min Sum Edge Coloring in Multigraphs Via Configuration LP.In Proc. 13th Conf. Integer Prog. Combin. Optimiz. (IPCO) , 2008 . M.M. Halld\u00f3rsson, G. Kortsarz and M. Sviridenko. Min Sum Edge Coloring in Multigraphs Via Configuration LP.In Proc. 13th Conf. Integer Prog. Combin. Optimiz. (IPCO), 2008."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328922"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1210"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9118-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.07.009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080115"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90039-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214054"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2677"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125994.1126001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1031-8"},{"key":"e_1_3_2_1_13_1","volume-title":"An Asymptotic Approximation Scheme for Multigraph Edge Coloring.Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms","author":"Sanders P.","year":"2005","unstructured":"P. Sanders and D. Steurer . An Asymptotic Approximation Scheme for Multigraph Edge Coloring.Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms , 2005 . P. Sanders and D. Steurer. An Asymptotic Approximation Scheme for Multigraph Edge Coloring.Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646250.685520"},{"key":"e_1_3_2_1_16_1","volume-title":"Non-approximability Results For Scheduling Problems with Minsum Criteria.Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization, LNCS 1412","author":"Hoogeveen H.","year":"1998","unstructured":"H. Hoogeveen , P. Schuurman , and G. Woeginger . Non-approximability Results For Scheduling Problems with Minsum Criteria.Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization, LNCS 1412 , 353--366, 1998 . H. Hoogeveen, P. Schuurman, and G. Woeginger. Non-approximability Results For Scheduling Problems with Minsum Criteria.Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization, LNCS 1412, 353--366, 1998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00251-1"},{"key":"e_1_3_2_1_18_1","first-page":"287","volume":"5","author":"Queyranne M.","year":"2002","unstructured":"M. Queyranne and M. Sviridenko . Approximation Algorithms for Shop Scheduling Problems with Minsum Objective.Journal of Scheduling , 5 : 287 -- 305 , 2002 . M. Queyranne and M. Sviridenko. Approximation Algorithms for Shop Scheduling Problems with Minsum Objective.Journal of Scheduling, 5:287--305, 2002.","journal-title":"Approximation Algorithms for Shop Scheduling Problems with Minsum Objective.Journal of Scheduling"},{"key":"e_1_3_2_1_19_1","first-page":"145","volume-title":"An Experimental Study of Data Migration Algorithms.Workshop on Algorithm Engineering","author":"Anderson E.","year":"2001","unstructured":"E. Anderson , J. Hall , J. Hartline , M. Hobbes , A. Karlin , J. Saia , R. Swaminathan , and J. Wilkes . An Experimental Study of Data Migration Algorithms.Workshop on Algorithm Engineering , pages 145 -- 158 , 2001 . E. Anderson, J. Hall, J. Hartline, M. Hobbes, A. Karlin, J. Saia, R. Swaminathan, and J. Wilkes. An Experimental Study of Data Migration Algorithms.Workshop on Algorithm Engineering, pages 145--158, 2001."},{"key":"e_1_3_2_1_20_1","first-page":"620","volume-title":"On Algorithms for Effcient Data Migration.Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms","author":"Hall J.","year":"2001","unstructured":"J. Hall , J. Hartline , A. Karlin , J. Saia , and J. Wilkes . On Algorithms for Effcient Data Migration.Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms , pages 620 -- 629 , 2001 . J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes. On Algorithms for Effcient Data Migration.Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 620--629, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773156"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.006"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"D\u00e1niel Marx phMinimum sum multicoloring on the edges of planar graphs.WAOA pages 9--22 2004  D\u00e1niel Marx phMinimum sum multicoloring on the edges of planar graphs.WAOA pages 9--22 2004","DOI":"10.1007\/978-3-540-31833-0_3"},{"key":"e_1_3_2_1_24_1","volume-title":"Computer and intractability. A guide to the theory of NP-completenessFreeman","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computer and intractability. A guide to the theory of NP-completenessFreeman , 1979 . M. Garey and D. Johnson. Computer and intractability. A guide to the theory of NP-completenessFreeman, 1979."},{"key":"e_1_3_2_1_25_1","first-page":"137","volume-title":"MapReduce: Simplified Data Processing on Large Clusters.In Proc. of the 6th Symposium on Operating System Design and Implementation","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters.In Proc. of the 6th Symposium on Operating System Design and Implementation , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters.In Proc. of the 6th Symposium on Operating System Design and Implementation, pages 137--150, 2004."}],"event":{"name":"SPAA '11: 23rd 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":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":25,"alternative-id":["10.1145\/1989493.1989538","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989538","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}