{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:13Z","timestamp":1725555433523},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_1","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T15:01:49Z","timestamp":1273071709000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_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 and Computational Geometry\u00a010, 113\u2013121 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"1_CR2","unstructured":"Angelopoulos, S.: Improved bounds for the online Steiner tree problem in graphs of bounded edge-asymmetry. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248\u2013257 (2007)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Angelopoulos, S.: A near-tight bound for the online Steiner tree problem in graphs of bounded asymmetry. In: Proceedings of the 16th Annual European Symposium on Algorithms, pp. 76\u201387 (2008)","DOI":"10.1007\/978-3-540-87744-8_7"},{"issue":"3","key":"1_CR4","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\u00a051(3), 341\u2013358 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: Online algorithms for Steiner tree problems. In: Proceedings of the 29th Symp. on the Theory of Computing, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"key":"1_CR6","unstructured":"Bern, M., Eppstein, D.: Approximation Algorithms for NP-hard problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for Geometric Problems, ch. 8. PWS Publishing Company (1997)"},{"issue":"6","key":"1_CR7","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":"1_CR8","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":"4","key":"1_CR9","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"},{"issue":"2","key":"1_CR10","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 online Steiner problems. Information Processing Letters\u00a055(2), 59\u201363 (1995)","journal-title":"Information Processing Letters"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","volume":"30","author":"P. Winter","year":"1997","unstructured":"Winter, P., Zachariasen, M.: Euclidean Steiner minimum trees: An improved exact algorithm. Networks\u00a030(3), 149\u2013166 (1997)","journal-title":"Networks"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Zachariasen, M.: Rectilinear full Steiner tree generation. Networks\u00a02(33) (1999)","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<125::AID-NET4>3.0.CO;2-S"}],"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-642-12450-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:54:05Z","timestamp":1606168445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}