{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:19:28Z","timestamp":1742383168960},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_24","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"272-283","source":"Crossref","is-referenced-by-count":9,"title":["Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Laue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., et al.: Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In: STACS, pp. 418\u2013427 (2004)","DOI":"10.1007\/978-3-540-24749-4_37"},{"key":"24_CR2","unstructured":"Callahan, P.B., Rao Kosaraju, S.: Algorithms for dynamic closest pair and n-body potential fields. In: SODA (1995)"},{"key":"24_CR3","unstructured":"Chan, H.T.-H., et al.: On hierarchical routing in doubling metrics. In: SODA, pp. 762\u2013771 (2005)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Funke, S., Matijevic, D., Sanders, P.: Approximating energy efficient paths in wireless multi-hop networks. In: ESA, pp. 230\u2013241 (2003)","DOI":"10.1007\/978-3-540-39658-1_23"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-median clustering and their applications. In: STOC, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S. Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. SIAM Journal on Computing\u00a035(5), 1148\u20131184 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. J. Exp. Algorithmics\u00a08 (2003)","DOI":"10.1145\/996546.996548"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:49Z","timestamp":1605762709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_24","relation":{},"subject":[]}}