{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:22Z","timestamp":1725536002116},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_4","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"37-48","source":"Crossref","is-referenced-by-count":3,"title":["Online Priority Steiner Tree Problems"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"4_CR1","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. Computers and Operations Research\u00a032(8), 1953\u20131981 (2005)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TNET.2004.826288","volume":"12","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Naor, J., Schieber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE\/ACM Transactions on Networking\u00a012(2), 340\u2013348 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2\u20133","key":"4_CR3","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\u00a0324(2\u20133), 313\u2013324 (2004)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","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)"},{"issue":"4","key":"4_CR5","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 Transactions on Networking\u00a04(4), 558\u2013568 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Gupta, A., Naor, J., Sinha, A.: On the approximability of some network design problems. Transactions on Algorithms 4(2) (2008)","DOI":"10.1145\/1361192.1361200"},{"issue":"3","key":"4_CR7","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"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: Online algorithms for Steiner tree problems. In: Proceedings of the 39th Symposium on the Theory of Computing (STOC), pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"issue":"5","key":"4_CR9","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\u00a028(5), 451\u2013468 (1995)","journal-title":"Mathematical Systems Theory"},{"key":"4_CR10","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 and Computational Geometry\u00a010, 113\u2013121 (1993)","journal-title":"Discrete and Computational Geometry"},{"issue":"2","key":"4_CR11","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., Yan, D.C.K.: Linear bounds for on-line Steiner problems. Information Processing Letters\u00a055(2), 59\u201363 (1995)","journal-title":"Information Processing Letters"},{"issue":"6","key":"4_CR12","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. International Journal of Foundations of Computer Science\u00a013(6), 889\u2013910 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"4_CR13","unstructured":"Angelopoulos, S.: Improved bounds for the online Steiner tree problem in graphs of bounded edge-asymmetry. In: Proceedings of the 18th Annual Symposium on Discrete Algorithms (SODA), pp. 248\u2013257 (2007)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-87744-8_7","volume-title":"Algorithms - ESA 2008","author":"S. Angelopoulos","year":"2008","unstructured":"Angelopoulos, S.: A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 76\u201387. Springer, Heidelberg (2008)"},{"key":"4_CR15","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. In: Proceedings of the 15th Symposium on Discrete Algorithms (SODA), pp. 570\u2013579 (2005)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T15:28:50Z","timestamp":1558452530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}