{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:40Z","timestamp":1743095260916,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_5","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Temporal Flows in Temporal Networks"],"prefix":"10.1007","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kuszner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"5_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, L., Spirakis, P.G.: Flows in temporal networks. CoRR abs\/1606.01091 (2016)","DOI":"10.1007\/978-3-319-57586-5_5"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jpdc.2015.10.002","volume":"87","author":"EC Akrida","year":"2016","unstructured":"Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: Ephemeral networks with random availability of links: the case of fast networks. J. Parallel Distrib. Comput. 87, 109\u2013120 (2016)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-28684-6_8","volume-title":"Approximation and Online Algorithms","author":"EC Akrida","year":"2015","unstructured":"Akrida, E.C., G\u0105sieniec, L., Mertzios, G.B., Spirakis, P.G.: On temporally connected graphs of small cost. In: Sanit\u00e0, L., Skutella, M. (eds.) WAOA 2015. LNCS, vol. 9499, pp. 84\u201396. Springer, Cham (2015). doi:10.1007\/978-3-319-28684-6_8"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-28472-9_11","volume-title":"Algorithms for Sensor Systems","author":"EC Akrida","year":"2015","unstructured":"Akrida, E.C., Spirakis, P.G.: On verifying and maintaining connectivity of interval temporal networks. In: Bose, P., G\u0105sieniec, L.A., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 142\u2013154. Springer, Cham (2015). doi:10.1007\/978-3-319-28472-9_11"},{"issue":"1\u20134","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"JE Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20(1\u20134), 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 121\u2013132. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70575-8_11"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Batra, J., Garg, N., Kumar, A., M\u00f6mke, T., Wiese, A.: New approximation schemes for unsplittable flow on a path. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 47\u201358. SIAM (2015)","DOI":"10.1137\/1.9781611973730.5"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs, dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. (IJPEDS) 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emerg. Distrib. Syst. (IJPEDS)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chaintreau, A., Mtibaa, A., Massouli\u00e9, L., Diot, C.: The diameter of opportunistic mobile networks. In: Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2007, New York, NY, USA, 10\u201313 December 2007, p. 12 (2007)","DOI":"10.1145\/1364654.1364670"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1137\/090756053","volume":"24","author":"AEF Clementi","year":"2010","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time of edge-Markovian evolving graphs. SIAM J. Discret. Math. (SIDMA) 24(4), 1694\u20131712 (2010)","journal-title":"SIAM J. Discret. Math. (SIDMA)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-47672-7_36","volume-title":"Automata, Languages, and Programming","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 444\u2013455. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-47672-7_36"},{"key":"5_CR13","volume-title":"Flows in Networks","author":"DR Ford","year":"2010","unstructured":"Ford, D.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (2010)"},{"key":"5_CR14","unstructured":"Hoppe, B., Tardos, E.: The quickest transshipment problem. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 512\u2013521. Society for Industrial and Applied Mathematics, Philadelphia (1995)"},{"key":"5_CR15","unstructured":"Hoppe, B.E.: Efficient dynamic network flow algorithms. Ph.D. thesis (1995)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.dam.2014.06.008","volume":"178","author":"N Kamiyama","year":"2014","unstructured":"Kamiyama, N., Katoh, N.: The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. 178, 89\u2013100 (2014)","journal-title":"Discret. Appl. Math."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Madry, A.: Fast approximation algorithms for cut-based problems in undirected graphs. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, USA, 23\u201326 October 2010, pp. 245\u2013254 (2010)","DOI":"10.1109\/FOCS.2010.30"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39212-2_57"},{"key":"5_CR20","unstructured":"Orlin, J.B.: Max flows in O(nm) time, or better. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 765\u2013774 (2013)"},{"key":"5_CR21","volume-title":"Computational Complexity","author":"CM Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume":"8","author":"WB Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. Handb. Oper. Res. Manag. Sci. 8, 141\u2013295 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/moor.23.1.69","volume":"23","author":"T Radzik","year":"1998","unstructured":"Radzik, T.: Faster algorithms for the generalized network flow problem. Math. Oper. Res. 23(1), 69\u2013100 (1998)","journal-title":"Math. Oper. Res."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1007\/978-1-4939-2864-4_326","volume-title":"Encyclopedia of Algorithms","author":"MJ Serna","year":"2016","unstructured":"Serna, M.J.: Randomized parallel approximations to max flow. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1750\u20131753. Springer, New York (2016)"},{"key":"5_CR25","first-page":"451","volume-title":"Research Trends in Combinatorial Optimization","author":"M Skutella","year":"2008","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 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:47:19Z","timestamp":1710341239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}