{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:46:33Z","timestamp":1742942793306,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453458"},{"type":"electronic","value":"9783642453465"}],"license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45346-5_10","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T12:33:16Z","timestamp":1386851596000},"page":"123-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Bounds for the Minimum $$k$$-Storage Problem"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Diodati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina M.","family":"Pinotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex network. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90086-6","volume":"9","author":"R Bar-Yehuda","year":"1984","unstructured":"Bar-Yehuda, R., Moran, S.: On approximation problems related to the independent set and vertex cover problems. Discrete Appl. Math. 9(1), 1\u201310 (1984)","journal-title":"Discrete Appl. Math."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J Beasley","year":"1985","unstructured":"Beasley, J.: A note on solving large p-median problems. Eur. J. Oper. Res. 21, 270\u2013273 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. Technical Report 1305.1979, arXiv (2013)","DOI":"10.1145\/2591796.2591884"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"RD Galvao","year":"1996","unstructured":"Galvao, R.D., ReVelle, C.: A lagrangean heuristic for the maximal covering location problem. Eur. J. Oper. Res. 88(1), 114\u2013123 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/1084779.1084780","volume":"1","author":"D Ganesan","year":"2005","unstructured":"Ganesan, D., Greenstein, B., Estrin, D., Heidemann, J.S., Govindan, R.: Multiresolution storage and search in sensor networks. Trans. Storage 1(3), 277\u2013315 (2005)","journal-title":"Trans. Storage"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MPRV.2004.1269131","volume":"3","author":"J Gehrke","year":"2004","unstructured":"Gehrke, J., Madden, S.: Query processing in sensor networks. IEEE Perv. Comp. 3(1), 46\u201355 (2004)","journal-title":"IEEE Perv. Comp."},{"key":"10_CR9","unstructured":"GLPK. GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th ACM Symp. on Theory of Computing (STOC), pp. 731\u2013740 (2002)","DOI":"10.1145\/509907.510012"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Madden, S., Franklin, M.J., Hellerstein, J. M., Hong, W.: The design of an acquisitional query processor for sensor networks. In: SIGMOD Conference, pp. 491\u2013502 (2003)","DOI":"10.1145\/872757.872817"},{"key":"10_CR13","first-page":"169","volume-title":"SEA 2011. LNCS","author":"C Nagarajan","year":"2011","unstructured":"Nagarajan, C., Williamson, D.P.: An experimental evaluation of incremental and hierarchical k-median algorithms. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 169\u2013180. Springer, Heidelberg (2011)"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"10_CR15","first-page":"159","volume-title":"RANDOM 1998. LNCS","author":"M Raab","year":"1998","unstructured":"Raab, M., Steger, A.: balls into bins - a simple and tight analysis. In: Rolim, J., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"issue":"10","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1109\/TMC.2010.98","volume":"9","author":"B Sheng","year":"2010","unstructured":"Sheng, B., Li, Q., Mao, W.: Optimize storage placement in sensor networks. IEEE Trans. Mob. Comput. 9(10), 1437\u20131450 (2010)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Sheng, B., Tan, C.C., Li, Q., Mao, W.: An approximation algorithm for data storage placement in sensor networks. In: Proceedings of the International Conference on Wireless Algorithms, Systems and Applications (WASA), pp. 71\u201378. IEEE, New York (2007)","DOI":"10.1109\/WASA.2007.32"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/774763.774785","volume":"33","author":"S Shenker","year":"2003","unstructured":"Shenker, S., Ratnasamy, S., Karp, B., Govindan, R., Estrin, D.: Data-centric storage in sensornets. Comp. Commun. Rev. 33(1), 137\u2013142 (2003)","journal-title":"Comp. Commun. Rev."},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/565702.565708","volume":"6","author":"S Tilak","year":"2002","unstructured":"Tilak, S., Abu-Ghazaleh, N.B., Heinzelman, W.R.: A taxonomy of wireless micro-sensor network models. Mob. Comp. Commun. Rev. 6(2), 28\u201336 (2002)","journal-title":"Mob. Comp. Commun. Rev."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45346-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T21:01:35Z","timestamp":1675803695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45346-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"ISBN":["9783642453458","9783642453465"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45346-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013,12,13]]},"assertion":[{"value":"13 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}