{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:10:07Z","timestamp":1750471807264,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"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-62127-2_15","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"169-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Deterministic Algorithm for Online Steiner Tree Leasing"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., Pietrzyk, P.: Towards the price of leasing online. Journal of Combinatorial Optimization, 1\u201320 (2015)","key":"15_CR1","DOI":"10.1007\/s10878-015-9915-5"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-12691-3_3","volume-title":"Combinatorial Optimization and Applications","author":"S Abshoff","year":"2014","unstructured":"Abshoff, S., Markarian, C., Meyer auf der Heide, F.: Randomized online algorithms for set cover leasing problems. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 25\u201334. Springer, Cham (2014). doi:10.1007\/978-3-319-12691-3_3"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1006\/jagm.1997.0906","volume":"27","author":"S Albers","year":"1998","unstructured":"Albers, S., Koga, H.: New on-line algorithms for the page replication problem. Journal of Algorithms 27(1), 75\u201396 (1998)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. In: Proc. 8th ACM Symp. on Computational Geometry (SoCG), pp. 337\u2013343 (1992)","key":"15_CR4","DOI":"10.1145\/142675.142744"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-12450-1_1","volume-title":"Approximation and Online Algorithms","author":"S Angelopoulos","year":"2010","unstructured":"Angelopoulos, S.: On the competitiveness of the online asymmetric and euclidean steiner tree problems. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 1\u201312. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-12450-1_1"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-72792-7_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"BM Anthony","year":"2007","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 424\u2013438. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-72792-7_32"},{"unstructured":"Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R.H., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: Above the clouds: A Berkeley view of cloud computing. Tech. Rep. UCB\/EECS-2009-28, EECS Department, University of California, Berkeley (2009). https:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/2009\/EECS-2009-28.pdf","key":"15_CR7"},{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 542\u2013547 (1997)","key":"15_CR8","DOI":"10.1109\/SFCS.1997.646143"},{"issue":"2\u20133","key":"15_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.tcs.2004.05.021","volume":"324","author":"B Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized Steiner problem. Theoretical Computer Science 324(2\u20133), 313\u2013324 (2004)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: Proc. 25th ACM Symp. on Theory of Computing (STOC), pp. 164\u2013173 (1993)","key":"15_CR10","DOI":"10.1145\/167088.167142"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jcss.1995.1073","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. Journal of Computer and System Sciences 51(3), 341\u2013358 (1995)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University (1989)","key":"15_CR12"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1016\/j.comnet.2009.10.017","volume":"54","author":"NMK Chowdhury","year":"2010","unstructured":"Chowdhury, N.M.K., Boutaba, R.: A survey of network virtualization. Computer Networks 54(5), 862\u2013876 (2010)","journal-title":"Computer Networks"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences 69(3), 485\u2013497 (2004)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2\u20133","key":"15_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2004.05.017","volume":"324","author":"R Fleischer","year":"2004","unstructured":"Fleischer, R., G\u0142azek, W., Seiden, S.S.: New results for online page replication. Theoretical Computer Science 324(2\u20133), 219\u2013251 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM Journal on Discrete Mathematics 4(3), 369\u2013384 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1137\/S0097539795287824","volume":"28","author":"C Lund","year":"1999","unstructured":"Lund, C., Reingold, N., Westbrook, J., Yan, D.C.K.: Competitive on-line algorithms for distributed data management. SIAM Journal on Computing 28(3), 1086\u20131111 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-51741-4_11","volume-title":"Approximation and Online Algorithms","author":"A Matsubayashi","year":"2017","unstructured":"Matsubayashi, A.: Non-greedy online steiner trees on outerplanar graphs. In: Jansen, K., Mastrolilli, M. (eds.) WAOA 2016. LNCS, vol. 10138, pp. 129\u2013141. Springer, Cham (2017). doi:10.1007\/978-3-319-51741-4_11"},{"doi-asserted-by":"crossref","unstructured":"Meyerson, A.: The parking permit problem. In: Proc. 46th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 274\u2013284 (2005)","key":"15_CR19","DOI":"10.1109\/SFCS.2005.72"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.disopt.2013.10.001","volume":"10","author":"C Nagarajan","year":"2013","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Discrete Optimization 10(4), 361\u2013370 (2013)","journal-title":"Discrete Optimization"},{"doi-asserted-by":"crossref","unstructured":"Umboh, S.: Online network design algorithms via hierarchical decompositions. In: Proc. 26th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1373\u20131387 (2015)","key":"15_CR21","DOI":"10.1137\/1.9781611973730.91"},{"issue":"5","key":"15_CR22","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF01185867","volume":"28","author":"J Westbrook","year":"1995","unstructured":"Westbrook, J., Yan, D.C.K.: The performance of greedy algorithms for the on-line Steiner tree and related problems. Mathematical Systems Theory 28(5), 451\u2013468 (1995)","journal-title":"Mathematical Systems Theory"},{"doi-asserted-by":"crossref","unstructured":"Wu, W., Huang, Y.: Steiner trees. In: Encyclopedia of Algorithms, pp. 2102\u20132107 (2016)","key":"15_CR23","DOI":"10.1007\/978-1-4939-2864-4_403"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:34:02Z","timestamp":1750469642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_15","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":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}