{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:14:11Z","timestamp":1794341651696,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540380443","type":"print"},{"value":"9783540380450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_9","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T08:33:54Z","timestamp":1156494834000},"page":"70-81","source":"Crossref","is-referenced-by-count":8,"title":["A Tight Lower Bound for the Steiner Point Removal Problem on Trees"],"prefix":"10.1007","author":[{"given":"T. -H. Hubert","family":"Chan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donglin","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goran","family":"Konjevod","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Richa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. In: SODA, pp. 220\u2013227 (2001)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00009336","volume":"19","author":"Y. Rabinovich","year":"1998","unstructured":"Rabinovich, Y., Raz, R.: Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Comput. Geom.\u00a019(1), 79\u201394 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Chu, Y., Rao, S., Zhang, H.: A case for end system multicast. In: Proceedings of ACM Sigmetrics, Santa Clara, CA (2000)","DOI":"10.1145\/339331.339337"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Xie, J., Talpade, R.R., Mcauley, A., Liu, M.: Amroute: ad hoc multicast routing protocol. Mob. Netw. Appl.\u00a07(6) (2002)","DOI":"10.1023\/A:1020748431138"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chawathe, Y.: Scattercast: an adaptable broadcast distribution framework. Multimedia Syst.\u00a09(1) (2003)","DOI":"10.1007\/s00530-002-0082-z"},{"key":"9_CR6","unstructured":"Francis, P.: Yoid: Extending the internet multicast architecture (2000)"},{"key":"9_CR7","unstructured":"Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Embedding k-outerplanar graphs into \u21131. In: Proceedings of the\u00a014th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 527\u2013536 (2003)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1145\/780542.780608","volume-title":"Proceedings of the thirty-fifth ACM symposium on Theory of computing","author":"J. Fakcharoenphol","year":"2003","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 448\u2013455. ACM Press, New York (2003)"},{"key":"9_CR9","unstructured":"Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, E.: Approximate classification via earthmover metrics. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1072\u20131080 (2004)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: Proceedings of the\u00a037th\u00a0Annual ACM Symposium on Theory of Computing, pp. 494\u2013503 (2005)","DOI":"10.1145\/1060590.1060665"},{"key":"9_CR11","unstructured":"Dhamdhere, K., Gupta, A., R\u00e4cke, H.: Improved embeddings of graph metrics into random trees"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:18:40Z","timestamp":1605626320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11830924_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11830924","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}