{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T23:03:46Z","timestamp":1784070226298,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819233083","type":"print"},{"value":"9789819233090","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-3309-0_15","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:05Z","timestamp":1784066885000},"page":"192-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Structure of\u00a0Generalized Flows over\u00a0Time: Why Storage is Unnecessary"],"prefix":"10.1007","author":[{"given":"Siyuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengminjie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheyu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"key":"15_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1995","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ (1995)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"EJ Aronson","year":"1989","unstructured":"Aronson, E.J.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36, 1600\u20131630 (2007)","journal-title":"SIAM J. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, E.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23, 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"15_CR6","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)"},{"key":"15_CR7","unstructured":"Gondran, M., Minoux, M.: Graphs and Algorithms. Wiley, New York (1984)"},{"key":"15_CR8","unstructured":"Gro\u00df, M.: Approximation algorithms for complex network flow over time problems. PhD thesis, Technical University of Berlin (2014)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-29116-6_21","volume-title":"Approximation and Online Algorithms","author":"M Gro\u00df","year":"2012","unstructured":"Gro\u00df, M., Skutella, M.: Generalized maximum flows over time. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 247\u2013260. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29116-6_21"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.orl.2014.12.008","volume":"43","author":"M Gro\u00df","year":"2015","unstructured":"Gro\u00df, M., Skutella, M.: A tight bound on the speed-up through storage for quickest multi-commodity flows. Oper. Res. Lett. 43(1), 93\u201395 (2015)","journal-title":"Oper. Res. Lett."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production. Transl. Manag. Sci. 6, 366\u2013422 (1960). Publication House of the Leningrad State University (1939)","DOI":"10.1287\/mnsc.6.4.366"},{"key":"15_CR12","unstructured":"Lin, Y.: Algorithms for the Generalized Network Flow Problem. PhD thesis, Columbia University (2001)"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3383454","volume":"67","author":"N Olver","year":"2020","unstructured":"Olver, N., V\u00e9gh, L.A.: A simpler and faster strongly polynomial algorithm for generalized flow maximization. J. ACM (JACM) 67(2), 1\u201326 (2020)","journal-title":"J. ACM (JACM)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"V\u00e9gh, L.A.: A strongly polynomial algorithm for generalized flow maximization. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 644\u2013653 (2014)","DOI":"10.1145\/2591796.2591806"},{"key":"15_CR16","unstructured":"Wayne, K.D.: Generalized Maximum Flow Algorithms. PhD thesis, Cornell University (1999)"},{"key":"15_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/9781316888568","volume-title":"Network Flow Algorithms","author":"DP Williamson","year":"2019","unstructured":"Williamson, D.P.: Network Flow Algorithms. Cambridge University Press, Cambridge, UK (2019)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3309-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:06Z","timestamp":1784066886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3309-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819233083","9789819233090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3309-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"23 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.ntu.edu.sg\/cocoon2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}