{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:02Z","timestamp":1759847462070},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693260"},{"type":"electronic","value":"9783540693550"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69355-0_7","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"61-73","source":"Crossref","is-referenced-by-count":5,"title":["Distributed Approximation Algorithm for Resource Clustering"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Bonichon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Duchon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Larchev\u00eaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Folding@home, \n                    \n                      http:\/\/folding.stanford.edu\/"},{"key":"7_CR2","unstructured":"World community grid, \n                    \n                      http:\/\/www.worldcommunitygrid.org"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/GRID.2004.14","volume-title":"GRID 2004. Proceedings of the Fifth IEEE\/ACM International Workshop on Grid Computing","author":"D.P. Anderson","year":"2004","unstructured":"Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: GRID 2004. Proceedings of the Fifth IEEE\/ACM International Workshop on Grid Computing, Washington, DC, USA, pp. 4\u201310. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"11","key":"7_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"D.P. Anderson","year":"2002","unstructured":"Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: Seti@home: an experiment in public-resource computing. Commun. ACM\u00a045(11), 56\u201361 (2002)","journal-title":"Commun. ACM"},{"key":"7_CR5","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 384\u2013393 (2003)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.F. Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one-dimensional bin packing problem. Journal of algorithms(Print)\u00a05(4), 502\u2013525 (1984)","journal-title":"Journal of algorithms(Print)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/972374.972394","volume":"34","author":"R. Cox","year":"2004","unstructured":"Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Practical, distributed network coordinates. ACM SIGCOMM Computer Communication Review\u00a034(1), 113\u2013118 (2004)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"7_CR8","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 557\u2013566 (2001)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 15\u201326 (2004)","DOI":"10.1145\/1015467.1015471"},{"key":"7_CR10","unstructured":"Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for approximate disk covering algorithms (2001)"},{"key":"7_CR11","unstructured":"Munro, J.I., Papadakis, T., Sedgewick, R.: Deterministic skip lists. In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 367\u2013375 (1992)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. In: Workshop on Algorithms and Data Structures, pp. 437\u2013449 (1989)","DOI":"10.1007\/3-540-51542-9_36"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69355-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:42:23Z","timestamp":1558280543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69355-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693260","9783540693550"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69355-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}