{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:00:14Z","timestamp":1725847214347},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286839"},{"type":"electronic","value":"9783319286846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28684-6_8","type":"book-chapter","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T05:32:03Z","timestamp":1452576723000},"page":"84-96","source":"Crossref","is-referenced-by-count":7,"title":["On Temporally Connected Graphs of Small Cost"],"prefix":"10.1007","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Mertzios","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":[[2016,1,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Akrida, E.C., G\u0105sieniec, L., Mertzios, G.B., Spirakis, P.G.: Ephemeral networks with random availability of links: Diameter and connectivity. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2014)","DOI":"10.1145\/2612669.2612693"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288\u2013298. Springer, Heidelberg (1997)"},{"key":"8_CR3","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, Part I. LNCS, vol. 5125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B-M Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B.-M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR5","unstructured":"Casteigts, A., Flocchini, P.: Deterministic Algorithms in Dynamic Networks: Formal Models and Metrics. Defence R&D Canada, Technical report, April 2013"},{"key":"8_CR6","unstructured":"Casteigts, A., Flocchini, P.: Deterministic Algorithms in Dynamic Networks: Problems, Analysis, and Algorithmic Tools. Defence R&D Canada, Technical report, April 2013"},{"issue":"5","key":"8_CR7","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 and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. (IJPEDS) 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst. (IJPEDS)"},{"issue":"4","key":"8_CR8","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. Discrete Math. (SIDMA) 24(4), 1694\u20131712 (2010)","journal-title":"SIAM J. Discrete Math. (SIDMA)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"issue":"6","key":"8_CR10","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(6), 1600\u20131630 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3\u20135","key":"8_CR11","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, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3\u20135), 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1137\/09076725X","volume":"41","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Krishnaswamy, R., Ravi, R.: Online and stochastic survivable network design. SIAM J. Comput. 41(6), 1649\u20131672 (2012)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","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"},{"issue":"4\u20135","key":"8_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(98)00009-1","volume":"22","author":"B Klinz","year":"1998","unstructured":"Klinz, B., Woeginger, G.J.: One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Oper. Res. Lett. 22(4\u20135), 119\u2013127 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00186-011-0357-2","volume":"73","author":"R Koch","year":"2011","unstructured":"Koch, R., Nasrabadi, E., Skutella, M.: Continuous and discrete flows over time - A general model based on measure theory. Math. Meth. of OR 73(3), 301\u2013337 (2011)","journal-title":"Math. Meth. of OR"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/978-3-662-43948-7_59","volume-title":"Automata, Languages, and Programming","author":"S Kontogiannis","year":"2014","unstructured":"Kontogiannis, S., Zaroliagis, C.: Distance oracles for time-dependent networks. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 713\u2013725. Springer, Heidelberg (2014)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/070700620","volume":"39","author":"LC Lau","year":"2009","unstructured":"Lau, L.C., Naor, J., Salavatipour, M.R., Singh, M.: Survivable network design with degree or order constraints. SIAM J. Comput. 39(3), 1062\u20131087 (2009)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1137\/110854461","volume":"42","author":"LC Lau","year":"2013","unstructured":"Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. SIAM J. Comput. 42(6), 2217\u20132242 (2013)","journal-title":"SIAM J. Comput."},{"key":"8_CR20","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.U., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-35476-2_19","volume-title":"Principles of Distributed Systems","author":"O Michail","year":"2012","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 269\u2013283. Springer, Heidelberg (2012)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-45841-7_2","volume-title":"STACS 2002","author":"C Scheideler","year":"2002","unstructured":"Scheideler, C.: Models and techniques for communication in dynamic networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 27\u201349. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28684-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:58:36Z","timestamp":1559368716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28684-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319286839","9783319286846"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28684-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}