{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:04:58Z","timestamp":1779602698860,"version":"3.53.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-26465-7_23","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:49:18Z","timestamp":1779601758000},"page":"430-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indirect Coflow Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6714-5034","authenticated-orcid":false,"given":"Alexander","family":"Lindermayr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5680-1753","authenticated-orcid":false,"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3592-3756","authenticated-orcid":false,"given":"Andr\u00e9a","family":"W. Richa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2579-1147","authenticated-orcid":false,"given":"Tegan","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Addanki, V., Avin, C., Schmid, S.: Mars: near-optimal throughput with shallow buffers in reconfigurable datacenter networks. Proc. ACM Meas. Anal. Comput. Syst. 7(1), 2:1\u20132:43 (2023). https:\/\/doi.org\/10.1145\/3579312","DOI":"10.1145\/3579312"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Ahmadi, S., Khuller, S., Purohit, M., Yang, S.: On scheduling CoFlows. Algorithmica 82(12), 3604\u20133629 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00741-3","DOI":"10.1007\/s00453-020-00741-3"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Amir, D., Saran, N., Wilson, T., Kleinberg, R., Shrivastav, V., Weatherspoon, H.: Shale: a practical, scalable oblivious reconfigurable network. In: SIGCOMM, pp. 449\u2013464. ACM (2024). https:\/\/doi.org\/10.1145\/3651890.3672248","DOI":"10.1145\/3651890.3672248"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Amir, D., Wilson, T., Shrivastav, V., Weatherspoon, H., Kleinberg, R., Agarwal, R.: Optimal oblivious reconfigurable networks. In: STOC, pp. 1339\u20131352. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520020","DOI":"10.1145\/3519935.3520020"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Avin, C., Schmid, S.: Revolutionizing datacenter networks via reconfigurable topologies. Commun. ACM 68(6), 44\u201353 (2025). https:\/\/doi.org\/10.1145\/3708980","DOI":"10.1145\/3708980"},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Ballani, H., et al.: Sirius: a flat datacenter network with nanosecond optical switching. In: SIGCOMM, pp. 782\u2013797. ACM (2020). https:\/\/doi.org\/10.1145\/3387514.3406221","DOI":"10.1145\/3387514.3406221"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Bansal, N., Khot, S.: Optimal long code test with one free bit. In: FOCS, pp. 453\u2013462. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.23","DOI":"10.1109\/FOCS.2009.23"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183\u2013202 (1998). https:\/\/doi.org\/10.1006\/inco.1997.2677","DOI":"10.1006\/inco.1997.2677"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Bar-Noy, A., Halld\u00f3rsson, M.M., Kortsarz, G., Salman, R., Shachnai, H.: Sum multicoloring of graphs. J. Algorithms 37(2), 422\u2013450 (2000). https:\/\/doi.org\/10.1006\/jagm.2000.1106","DOI":"10.1006\/jagm.2000.1106"},{"key":"23_CR10","unstructured":"Bhimaraju, A., Nayak, D., Vaze, R.: Non-clairvoyant scheduling of CoFlows. In: WiOpt, pp. 81\u201388. IEEE (2020). https:\/\/dl.ifip.org\/db\/conf\/wiopt\/wiopt2020\/32.pdf"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Chowdhury, M., Khuller, S., Purohit, M., Yang, S., You, J.: Near optimal CoFlow scheduling in networks. In: SPAA, pp. 123\u2013134. ACM (2019). https:\/\/doi.org\/10.1145\/3323165.3323179","DOI":"10.1145\/3323165.3323179"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Chowdhury, M., Stoica, I.: CoFlow: a networking abstraction for cluster applications. In: HotNets, pp. 31\u201336. ACM (2012). https:\/\/doi.org\/10.1145\/2390231.2390237","DOI":"10.1145\/2390231.2390237"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Chowdhury, M., Stoica, I.: Efficient CoFlow scheduling without prior knowledge. In: SIGCOMM, pp. 393\u2013406. ACM (2015). https:\/\/doi.org\/10.1145\/2785956.2787480","DOI":"10.1145\/2785956.2787480"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient CoFlow scheduling with VARYS. In: SIGCOMM. pp. 443\u2013454. ACM (2014). https:\/\/doi.org\/10.1145\/2619239.2626315","DOI":"10.1145\/2619239.2626315"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Dinitz, M., Moseley, B.: Scheduling for weighted flow and completion times in reconfigurable networks. In: INFOCOM, pp. 1043\u20131052. IEEE (2020). https:\/\/doi.org\/10.1109\/INFOCOM41043.2020.9155537","DOI":"10.1109\/INFOCOM41043.2020.9155537"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1), 11:1\u201311:20 (2008). https:\/\/doi.org\/10.1145\/1328911.1328922","DOI":"10.1145\/1328911.1328922"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Gandhi, R., Mestre, J.: Combinatorial algorithms for data migration to minimize average completion time. Algorithmica 54(1), 54\u201371 (2009). https:\/\/doi.org\/10.1007\/s00453-007-9118-2","DOI":"10.1007\/s00453-007-9118-2"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Ghorbani, S., Yang, Z., Godfrey, P.B., Ganjali, Y., Firoozshahian, A.: DRILL: micro load balancing for low-latency data center networks. In: SIGCOMM, pp. 225\u2013238. ACM (2017). https:\/\/doi.org\/10.1145\/3098822.3098839","DOI":"10.1145\/3098822.3098839"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. ACM 28(2), 289\u2013304 (1981)","DOI":"10.1145\/322248.322254"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing average completion of dedicated tasks and interval graphs. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM -2001. LNCS, vol. 2129, pp. 114\u2013126. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44666-4_15","DOI":"10.1007\/3-540-44666-4_15"},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Sviridenko, M.: Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2), 22:1\u201322:21 (2011). https:\/\/doi.org\/10.1145\/1921659.1921668","DOI":"10.1145\/1921659.1921668"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Im, S., Kulkarni, J., Munagala, K.: Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints. J. ACM 65(1), 3:1\u20133:33 (2018). https:\/\/doi.org\/10.1145\/3136754","DOI":"10.1145\/3136754"},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Im, S., Moseley, B., Pruhs, K., Purohit, M.: Matroid CoFlow scheduling. In: ICALP. LIPIcs, vol.\u00a0132, pp. 145:1\u2013145:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.145","DOI":"10.4230\/LIPIcs.ICALP.2019.145"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"J\u00e4ger, S., Lindermayr, A., Megow, N.: The power of proportional fairness for non-clairvoyant scheduling under polyhedral constraints. In: SODA, pp. 3901\u20133930. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.132","DOI":"10.1137\/1.9781611978322.132"},{"key":"23_CR25","doi-asserted-by":"publisher","unstructured":"Jahanjou, H., Kantor, E., Rajaraman, R.: Asymptotically optimal approximation algorithms for CoFlow scheduling. In: SPAA, pp. 45\u201354. ACM (2017). https:\/\/doi.org\/10.1145\/3087556.3087567","DOI":"10.1145\/3087556.3087567"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Khuller, S., Kim, Y.A., Wan, Y.J.: Algorithms for data migration with cloning. SIAM J. Comput. 33(2), 448\u2013461 (2004). https:\/\/doi.org\/10.1137\/S009753970342585X","DOI":"10.1137\/S009753970342585X"},{"key":"23_CR27","doi-asserted-by":"publisher","unstructured":"Khuller, S., Li, J., Sturmfels, P., Sun, K., Venkat, P.: Select and permute: an improved online framework for scheduling to minimize weighted completion time. Theor. Comput. Sci. 795, 420\u2013431 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.07.026","DOI":"10.1016\/j.tcs.2019.07.026"},{"key":"23_CR28","doi-asserted-by":"publisher","unstructured":"Khuller, S., Purohit, M.: Brief announcement: improved approximation algorithms for scheduling co-flows. In: SPAA, pp. 239\u2013240. ACM (2016). https:\/\/doi.org\/10.1145\/2935764.2935809","DOI":"10.1145\/2935764.2935809"},{"key":"23_CR29","doi-asserted-by":"publisher","unstructured":"Kim, Y.A.: Data migration to minimize the total completion time. J. Algorithms 55(1), 42\u201357 (2005). https:\/\/doi.org\/10.1016\/j.jalgor.2004.07.009","DOI":"10.1016\/j.jalgor.2004.07.009"},{"key":"23_CR30","unstructured":"Lindermayr, A., Liu, Z., Megow, N.: Polytope scheduling with groups: unified models and optimal guarantees. In: IPCO. Springer (2026), to appear"},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"Liu, H., et al.: Lightwave fabrics: at-scale optical circuit switching for datacenter and machine learning systems. In: Proceedings of the ACM SIGCOMM 2023 Conference, pp. 499\u2013515. ACM SIGCOMM 2023, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3603269.3604836","DOI":"10.1145\/3603269.3604836"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Marx, D.: Complexity results for minimum sum edge coloring. Discret. Appl. Math. 157(5), 1034\u20131045 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.04.002","DOI":"10.1016\/j.dam.2008.04.002"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Mellette, W.M., Forencich, A., Athapathu, R., Snoeren, A.C., Papen, G., Porter, G.: Realizing RotorNet: toward practical microsecond scale optical networking. In: SIGCOMM, pp. 392\u2013414. ACM (2024). https:\/\/doi.org\/10.1145\/3651890.3672273","DOI":"10.1145\/3651890.3672273"},{"key":"23_CR34","doi-asserted-by":"publisher","unstructured":"Mestre, J.: Adaptive local ratio. SIAM J. Comput. 39(7), 3038\u20133057 (2010). https:\/\/doi.org\/10.1137\/080731712","DOI":"10.1137\/080731712"},{"key":"23_CR35","doi-asserted-by":"publisher","unstructured":"Qiu, Z., Stein, C., Zhong, Y.: Minimizing the total weighted completion time of CoFlows in datacenter networks. In: SPAA, pp. 294\u2013303. ACM (2015). https:\/\/doi.org\/10.1145\/2755573.2755592","DOI":"10.1145\/2755573.2755592"},{"key":"23_CR36","doi-asserted-by":"publisher","unstructured":"Queyranne, M., Sviridenko, M.: A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2), 202\u2013212 (2002). https:\/\/doi.org\/10.1016\/S0196-6774(02)00251-1","DOI":"10.1016\/S0196-6774(02)00251-1"},{"key":"23_CR37","doi-asserted-by":"publisher","unstructured":"Rohwedder, L., Schnaars, L.: 3.415-approximation for CoFlow scheduling via iterated rounding. In: ICALP. LIPIcs, vol.\u00a0334, pp. 128:1\u2013128:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025), https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2025.128","DOI":"10.4230\/LIPIcs.ICALP.2025.128"},{"key":"23_CR38","unstructured":"Schrijver, A., et\u00a0al.: Combinatorial Optimization: Polyhedra and Efficiency, vol.\u00a024. Springer (2003). https:\/\/link.springer.com\/book\/9783540443896"},{"key":"23_CR39","doi-asserted-by":"publisher","unstructured":"Shafiee, M., Ghaderi, J.: Brief announcement: a new improved bound for CoFlow scheduling. In: SPAA, pp. 91\u201393. ACM (2017). https:\/\/doi.org\/10.1145\/3087556.3087598","DOI":"10.1145\/3087556.3087598"},{"key":"23_CR40","unstructured":"Shrivastav, V., et al.: Shoal: a network architecture for disaggregated racks. In: NSDI, pp. 255\u2013270. USENIX Association (2019). https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/shrivastav"},{"key":"23_CR41","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: A scheme for fast parallel communication. SIAM J. Comput. 11(2), 350\u2013361 (1982). https:\/\/doi.org\/10.1137\/0211027","DOI":"10.1137\/0211027"},{"key":"23_CR42","doi-asserted-by":"publisher","unstructured":"Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. In: STOC, pp. 263\u2013277. ACM (1981). https:\/\/doi.org\/10.1145\/800076.802479","DOI":"10.1145\/800076.802479"},{"key":"23_CR43","doi-asserted-by":"publisher","unstructured":"Wilson, T., Amir, D., Saran, N., Kleinberg, R., Shrivastav, V., Weatherspoon, H.: Breaking the VLB barrier for oblivious reconfigurable networks. In: STOC, pp. 1865\u20131876. ACM (2024). https:\/\/doi.org\/10.1145\/3618260.3649608","DOI":"10.1145\/3618260.3649608"},{"key":"23_CR44","doi-asserted-by":"publisher","unstructured":"Wilson, T., Amir, D., Shrivastav, V., Weatherspoon, H., Kleinberg, R.: Extending optimal oblivious reconfigurable networks to all N. In: APOCS, pp. 1\u201316. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977578.ch1","DOI":"10.1137\/1.9781611977578.ch1"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:49:20Z","timestamp":1779601760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}