{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:56:07Z","timestamp":1780073767732,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google","award":["Google Research Award"],"award-info":[{"award-number":["Google Research Award"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CSR-1217981"],"award-info":[{"award-number":["CSR-1217981"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1422715"],"award-info":[{"award-number":["CCF-1422715"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087567","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"45-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Asymptotically Optimal Approximation Algorithms for Coflow Scheduling"],"prefix":"10.1145","author":[{"given":"Hamidreza","family":"Jahanjou","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erez","family":"Kantor","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications. x0--13--617549-X","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . 1993 . Network Flows: Theory, Algorithms, and Applications. x0--13--617549-X R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. x0--13--617549-X"},{"key":"e_1_3_2_1_2_1","volume-title":"Hedera: Dynamic Flow Scheduling for Data Center Networks. In NSDI.","author":"Al-Fares M.","year":"2010","unstructured":"M. Al-Fares , S. Radhakrishnan , B Raghavan , N. Huang , and A. Vahdat . 2010 . Hedera: Dynamic Flow Scheduling for Data Center Networks. In NSDI. M. Al-Fares, S. Radhakrishnan, B Raghavan, N. Huang, and A. Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In NSDI."},{"key":"e_1_3_2_1_3_1","volume-title":"Hedera: Dynamic Flow Scheduling for Data Center Networks. In USENIX.","author":"Al-Fares Mohammad","year":"2010","unstructured":"Mohammad Al-Fares , Sivasankar Radhakrishnan , Barath Raghavan , Nelson Huang , and Amin Vahdat . 2010 . Hedera: Dynamic Flow Scheduling for Data Center Networks. In USENIX. Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks. In USENIX."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390237"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626315"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250816"},{"key":"e_1_3_2_1_9_1","volume-title":"The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders","author":"Correa Jos\u00e9 R.","unstructured":"Jos\u00e9 R. Correa , Martin Skutella , and Jos\u00e9 Verschae . 2009. The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders . Springer Berlin Heidelberg , Berlin, Heidelberg , 84--97. x978--3--642-03685--9 https:\/\/doi.org\/10.1007\/978--3--642-03685--9_7 10.1007\/978--3--642-03685--9_7 Jos\u00e9 R. Correa, Martin Skutella, and Jos\u00e9 Verschae. 2009. The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Springer Berlin Heidelberg, Berlin, Heidelberg, 84--97. x978--3--642-03685--9 https:\/\/doi.org\/10.1007\/978--3--642-03685--9_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"N. Garg A. Kumar and V. Pandit. 2007. Order Scheduling Models: Hardness and Algorithms. In FSTTCS.  N. Garg A. Kumar and V. Pandit. 2007. Order Scheduling Models: Hardness and Algorithms. In FSTTCS.","DOI":"10.1007\/978-3-540-77050-3_8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"S. Khuller and M. Purohit. 2016. Improved Approximation Algorithms for Scheduling Co-Flows. In SPAA. Brief Announcement.  S. Khuller and M. Purohit. 2016. Improved Approximation Algorithms for Scheduling Co-Flows. In SPAA. Brief Announcement.","DOI":"10.1145\/2935764.2935809"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44499-8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Jr. L. R. Ford and D. R. Fulkerson. 1958. Constructing Maximal Dynamic Flows from Static Flows. Operations Research 6 3 (1958).  Jr. L. R. Ford and D. R. Fulkerson. 1958. Constructing Maximal Dynamic Flows from Static Flows. Operations Research 6 3 (1958).","DOI":"10.1287\/opre.6.3.419"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"F.T. Leighton B.M. Maggs and S.B. Rao. 1994. Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994).  F.T. Leighton B.M. Maggs and S.B. Rao. 1994. Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994).","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"F. T. Leighton B.M. Maggs and A.W. Richa. 1999. Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules. Combinatorica 19 3 (1999).  F. T. Leighton B.M. Maggs and A.W. Richa. 1999. Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules. Combinatorica 19 3 (1999).","DOI":"10.1007\/s004930050061"},{"key":"e_1_3_2_1_21_1","unstructured":"J. Y-T. Leung H. Li and M. Pinedo. 2005. Order Scheduling Models: An Overview.  J. Y-T. Leung H. Li and M. Pinedo. 2005. Order Scheduling Models: An Overview."},{"key":"e_1_3_2_1_22_1","volume-title":"Packet Routing: Complexity and Algorithms. In WAOA.","author":"Peis B.","year":"2009","unstructured":"B. Peis , M. Skutella , and A. Wiese . 2009 . Packet Routing: Complexity and Algorithms. In WAOA. B. Peis, M. Skutella, and A. Wiese. 2009. Packet Routing: Complexity and Algorithms. In WAOA."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755592"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"M. Queyranne and M. Sviridenko. 2002. Approximation Algorithms for Shop Scheduling Problems with Minsum Objective. Journal of Scheduling (2002).  M. Queyranne and M. Sviridenko. 2002. Approximation Algorithms for Shop Scheduling Problems with Minsum Objective. Journal of Scheduling (2002).","DOI":"10.1002\/jos.96"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798335596"},{"key":"e_1_3_2_1_27_1","volume-title":"Spark: Cluster Computing with Working Sets. In HotCloud.","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M Chowdhury , M. J. Franklin , S. Shenker , and I. Stoica . 2010 . Spark: Cluster Computing with Working Sets. In HotCloud. M. Zaharia, M Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. 2010. Spark: Cluster Computing with Working Sets. In HotCloud."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"},{"key":"e_1_3_2_1_29_1","volume-title":"Rapier: Integrating routing and scheduling for coflow-aware data center networks. In INFOCOM.","author":"Zhao Y.","year":"2015","unstructured":"Y. Zhao , K. Chen , W. Bai , M. Yu , C. Tian , Y. Geng , Y. Zhang , D. Li , and S. Wang . 2015 . Rapier: Integrating routing and scheduling for coflow-aware data center networks. In INFOCOM. Y. Zhao, K. Chen, W. Bai, M. Yu, C. Tian, Y. Geng, Y. Zhang, D. Li, and S. Wang. 2015. Rapier: Integrating routing and scheduling for coflow-aware data center networks. In INFOCOM."}],"event":{"name":"SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Washington DC USA","acronym":"SPAA '17","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"]},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087567","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:13Z","timestamp":1750217413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":29,"alternative-id":["10.1145\/3087556.3087567","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087567","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}