{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:07Z","timestamp":1775054527339,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540877431","type":"print"},{"value":"9783540877448","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_7","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"76-87","source":"Crossref","is-referenced-by-count":4,"title":["A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Angelopoulos, S.: Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry. Technical Report CS-2006-36, David R. Cheriton School of Computer Science, University of Waterloo (2006)"},{"key":"7_CR2","first-page":"248","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S. Angelopoulos","year":"2007","unstructured":"Angelopoulos, S.: Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248\u2013257. ACM Press, New York (2007)"},{"issue":"2\u20133","key":"7_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.tcs.2004.05.021","volume":"324","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Bartal, B.: On-line Generalized Steiner Problem. Theor. Comp. Sci.\u00a0324(2\u20133), 313\u2013324 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02573969","volume":"10","author":"Y. Azar","year":"1993","unstructured":"Azar, Y., Alon, N.: On-line Steiner Trees in the Euclidean Plane. Discrete and Computational Geometry\u00a010, 113\u2013121 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: Online Algorithms for Steiner Tree Problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"key":"7_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Claffy, K.G., Polyzos, B.H.W.: Traffic Characteristics of the T1 NSFnet Backbone. In: IEEE-Infocom, pp. 885\u2013892 (1993)","DOI":"10.1109\/INFCOM.1993.253279"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1142\/S0129054102001527","volume":"13","author":"M. Faloutsos","year":"2002","unstructured":"Faloutsos, M., Pankaj, R., Sevcik, K.C.: The Effect of Asymmetry on the On-line Multicast Routing Problem. Int. J. Found. Comput. Sci.\u00a013(6), 889\u2013910 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: The Dynamic Steiner Tree Problem. SIAM Journal on Discrte Mathematics\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM Journal on Discrte Mathematics"},{"issue":"8","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: A Survey of Combinatorial Optimization Problems in Multicast Routing. Comput. Oper. Res.\u00a032(8), 1953\u20131981 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/90.532865","volume":"4","author":"S. Ramanathan","year":"1996","unstructured":"Ramanathan, S.: Multicast Tree Generation in Networks with Asymmetric Links. IEEE\/ACM Trans. Netw.\u00a04(4), 558\u2013568 (1996)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(95)00000-3","volume":"55","author":"J. Westbrook","year":"1995","unstructured":"Westbrook, J., Yam, D.C.K.: Linear Bounds for On-line Steiner Problems. Inf. Proc. Ltrs.\u00a055(2), 59\u201363 (1995)","journal-title":"Inf. Proc. Ltrs."},{"issue":"5","key":"7_CR13","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\u00a028(5), 451\u2013468 (1995)","journal-title":"Math. Syst. Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:05:14Z","timestamp":1738350314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}