{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:47:24Z","timestamp":1743050844252,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"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-04355-0_40","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"364-378","source":"Crossref","is-referenced-by-count":5,"title":["Compact Multicast Routing"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Ratajczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30186-8_22","volume-title":"Distributed Computing","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with Improved Communication-Space Trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 305\u2013319. Springer, Heidelberg (2004)"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1007912.1007916","volume-title":"SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 20\u201324. ACM Press, New York (2004)"},{"key":"40_CR3","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Distributed paging for general networks. In: SODA 1996: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 574\u2013583. Society for Industrial and Applied Mathematics (1996)"},{"key":"40_CR4","first-page":"503","volume-title":"31 th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: 31\n                    th\n                   Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013513. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/258533.258618","volume-title":"STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing","author":"P. Berman","year":"1997","unstructured":"Berman, P., Coulston, C.: On-line algorithms for steiner tree problems (extended abstract). In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 344\u2013353. ACM Press, New York (1997)"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"40_CR7","first-page":"970","volume-title":"SODA 2006: Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm","author":"A. Gupta","year":"2006","unstructured":"Gupta, A., Hajiaghayi, M.T., R\u00e4cke, H.: Oblivious network design. In: SODA 2006: Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm, pp. 970\u2013979. ACM Press, New York (2006)"},{"key":"40_CR8","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. Disc. Math.\u00a04, 369\u2013384 (1991)","journal-title":"SIAM J. Disc. Math."},{"key":"40_CR9","first-page":"386","volume-title":"STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing","author":"L. Jia","year":"2005","unstructured":"Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for tsp, steiner tree, and set cover. In: STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing, pp. 386\u2013395. ACM Press, New York (2005)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"40_CR11","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA 2000: Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 770\u2013779. Society for Industrial and Applied Mathematics (2000)"},{"key":"40_CR12","first-page":"1","volume-title":"13 th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13\n                    th\n                   Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, pp. 1\u201310. ACM Press, New York (2001)"},{"key":"40_CR13","first-page":"1","volume-title":"13 th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13\n                    th\n                   Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T17:58:56Z","timestamp":1552154336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}