{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:50Z","timestamp":1725878090381},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319517407"},{"type":"electronic","value":"9783319517414"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51741-4_11","type":"book-chapter","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T03:06:46Z","timestamp":1483672006000},"page":"129-141","source":"Crossref","is-referenced-by-count":2,"title":["Non-greedy Online Steiner Trees on Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 10, 113\u2013121 (1993)","journal-title":"Discret. Comput. Geom."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-03367-4_4","volume-title":"Algorithms and Data Structures","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. LNCS, vol. 5664, pp. 37\u201348. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03367-4_4"},{"key":"11_CR3","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"},{"key":"11_CR4","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":"11_CR5","doi-asserted-by":"crossref","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":"11_CR6","doi-asserted-by":"crossref","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":"11_CR7","doi-asserted-by":"crossref","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":"11_CR8","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":"11_CR9","doi-asserted-by":"crossref","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. Discret. Math. 20(1), 119\u2013136 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"11_CR10","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":"11_CR11","doi-asserted-by":"crossref","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":"11_CR12","doi-asserted-by":"crossref","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. Discret. Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"11_CR13","doi-asserted-by":"crossref","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":"11_CR14","doi-asserted-by":"crossref","unstructured":"Naor, J.S., Panigrahi, D., Singh, M.: Online node-weighted steiner tree and related problems. In: Proceedings 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 210\u2013219 (2011)","DOI":"10.1109\/FOCS.2011.65"},{"key":"11_CR15","doi-asserted-by":"crossref","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":"Math. Syst. Theory"}],"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-51741-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T02:37:51Z","timestamp":1568687871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51741-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319517407","9783319517414"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51741-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}