{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:51Z","timestamp":1740109311004,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00453-020-00768-6","type":"journal-article","created":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T07:02:41Z","timestamp":1602831761000},"page":"613-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-Greedy Online Steiner Trees on Outerplanar Graphs"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7861-4876","authenticated-orcid":false,"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,16]]},"reference":[{"key":"768_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02573969","volume":"10","author":"N Alon","year":"1993","unstructured":"Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. Discrete Comput. Geom. 10, 113\u2013121 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"768_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-03367-4_4","volume-title":"WADS 2009","author":"S Angelopoulos","year":"2009","unstructured":"Angelopoulos, S.: Online priority Steiner tree problems. In: Dehne, F., Gavrilova, M., Sack, J.R., T\u00f3th, C.D. (eds.) WADS 2009. Lecture Notes in Computer Science, vol. 5664, pp. 37\u201348. Springer, Heidelberg (2009)"},{"key":"768_CR3","doi-asserted-by":"crossref","unstructured":"Angelopoulos, S.: Parameterized analysis of online Steiner tree problems. In: Adaptive, Output Sensitive, Online and Parameterized Algorithms, Dagstuhl Seminar Proceedings (2009). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/2121","DOI":"10.1007\/978-3-642-03367-4_4"},{"key":"768_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"WAOA 2009","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. Lecture Notes in Computer Science, vol. 5893, pp. 1\u201312. Springer, Heidelberg (2010)"},{"key":"768_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.tcs.2004.05.021","volume":"324","author":"B Averbuch","year":"2004","unstructured":"Averbuch, B., Azar, Y., Bartal, Y.: On-line generalized Steiner problem. Theor. Comput. Sci. 324, 313\u2013324 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"768_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(03)00055-5","volume":"185","author":"B Awerbuch","year":"2003","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. Inf. Comput. 185(1), 1\u201340 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"768_CR7","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. J. Comput. Syst. Sci. 51(3), 341\u2013358 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"768_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11, 2\u201314 (1994)","journal-title":"Algorithmica"},{"key":"768_CR9","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: On-line algorithms for Steiner tree problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"issue":"1","key":"768_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/S0895480102417379","volume":"20","author":"C Chekuri","year":"2006","unstructured":"Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Embedding $$k$$-outerplanar graphs into $$\\ell _1$$. SIAM J. Discrete Math. 20(1), 119\u2013136 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"768_CR11","first-page":"215","volume":"38","author":"HJ Fleischner","year":"1974","unstructured":"Fleischner, H.J., Geller, D.P., Harary, F.: Outerplanar graphs and weak duals. J. Indian Math. Soc. 38, 215\u2013219 (1974)","journal-title":"J. Indian Math. Soc."},{"issue":"2","key":"768_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","volume":"24","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees, and $$\\ell _1$$-embedding of graphs. Combinatorica 24(2), 233\u2013269 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"768_CR13","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 J. Discrete Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"768_CR14","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.: Competitive on-line algorithms for distributed data management. SIAM J. Comput. 28(3), 1086\u20131111 (1999)","journal-title":"SIAM J. Comput."},{"key":"768_CR15","doi-asserted-by":"crossref","unstructured":"Naor, J.S., Panigrahi, D., Singh, M.: Online node-weighted Steiner tree and related problems. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 210\u2013219 (2011)","DOI":"10.1109\/FOCS.2011.65"},{"key":"768_CR16","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. Math. Syst. Theory 28, 451\u2013468 (1995)","journal-title":"Mat. Syst. Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00768-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00768-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00768-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T01:23:20Z","timestamp":1634347400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00768-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,16]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["768"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00768-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,10,16]]},"assertion":[{"value":"30 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}