{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:32:47Z","timestamp":1742394767084,"version":"3.33.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,4,25]],"date-time":"2007-04-25T00:00:00Z","timestamp":1177459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Grid Computing"],"published-print":{"date-parts":[[2007,10,4]]},"DOI":"10.1007\/s10723-007-9069-5","type":"journal-article","created":{"date-parts":[[2007,4,24]],"date-time":"2007-04-24T16:47:39Z","timestamp":1177433259000},"page":"361-378","source":"Crossref","is-referenced-by-count":15,"title":["A Local Facility Location Algorithm for Large-scale Distributed Systems"],"prefix":"10.1007","volume":"5","author":[{"given":"Denis","family":"Krivitski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assaf","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,25]]},"reference":[{"key":"9069_CR1","doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Khandekar, R., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: STOC \u201901: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 21\u201329. New York, NY, USA (2001)","DOI":"10.1145\/380752.380755"},{"key":"9069_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: STOC \u201989: Proceedings of the twentyfirst annual ACM symposium on Theory of computing, pp. 479\u2013489. New York, NY, USA (1989)","DOI":"10.1145\/73007.73053"},{"key":"9069_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 268\u2013277. Los Alamitos, CA, USA (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"key":"9069_CR4","unstructured":"Balinski., M.: On finding integer solutions to linear programs. Proc. IBM Scientific Computing Symp. on Combinatorial Problems, pp. 225\u2013248 (1966)"},{"key":"9069_CR5","doi-asserted-by":"crossref","unstructured":"Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. In: DISC. (2004)","DOI":"10.1007\/978-3-540-30186-8_20"},{"key":"9069_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: IEEE Symposium on Foundations of Computer Science, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"9069_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Large-scale Parallel Data Mining. pp. 245\u2013260 (2002)","DOI":"10.1007\/3-540-46502-2_13"},{"key":"9069_CR8","unstructured":"Ester, M., Kriegel, H., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: VLDB., pp. 323\u2013333 (1998)"},{"key":"9069_CR9","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)"},{"issue":"2","key":"9069_CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/380995.381010","volume":"2","author":"G. Forman","year":"2000","unstructured":"Forman, G., Zhang, B.: Distributed data clustering can be efficient and exact. SIGKDD Explor. Newsl. 2(2), 34\u201338 (2000)","journal-title":"SIGKDD Explor. Newsl."},{"key":"9069_CR11","doi-asserted-by":"crossref","unstructured":"Foti, D., Lipari, D., Pizzuti, C., Talia, D.: Scalable parallel clustering for data mining on multicomputers. In: IPDPS 00: Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing, pp. 390\u2013398. London, UK (2000)","DOI":"10.1007\/3-540-45591-4_51"},{"key":"9069_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)(1998)","DOI":"10.1006\/jagm.1998.0993"},{"issue":"2","key":"9069_CR13","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9069_CR14","doi-asserted-by":"crossref","unstructured":"Jaffe, J., Moss, F.: A responsive routing algorithm for computer networks. IEEE Trans. Commun. pp. 1758\u20131762 (1982)","DOI":"10.1109\/TCOM.1982.1095632"},{"key":"9069_CR15","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Primal\u2013Dual approximation algorithms for metric facility location and k-median problems. In: IEEE Symposium on Foundations of Computer Science. pp. 2\u201313 (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"9069_CR16","doi-asserted-by":"crossref","unstructured":"Kaashoek, F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. Peer-to-Peer Systems II: Second International Workshop (2003)","DOI":"10.1007\/978-3-540-45172-3_9"},{"issue":"4","key":"9069_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1009726428407","volume":"2","author":"J. Kleinberg","year":"1998","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: A microeconomic view of data mining. Data Mining and Knowledge Discovery 2(4), 311\u2013324 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9069_CR18","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms). pp. 1\u201310 (1998)"},{"key":"9069_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally!. In: PODC 04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. New York, NY, USA, pp. 300\u2013309 (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"9069_CR20","doi-asserted-by":"crossref","unstructured":"Kutten, S., Patt-Shamir, B.: Time-adaptive self stabilization. In: PODC 97: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing. New York, NY, USA, pp. 149\u2013158 (1997)","DOI":"10.1145\/259380.259435"},{"key":"9069_CR21","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fault-local distributed mending (extended abstract). In: PODC 95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing. New York, NY, USA, pp. 20\u201327 (1995)","DOI":"10.1145\/224964.224967"},{"issue":"1","key":"9069_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Comput. J. 21(1), 193\u2013201 (1992)","journal-title":"SIAM Comput. J."},{"key":"9069_CR23","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: universal topology generation from a user\u2019s perspective. Technical report, Boston, MA, USA (2001)"},{"key":"9069_CR24","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Facility location: distributed approximation. In: PODC 05: Proceedings of the twenty-fourth annual ACMSIGACT-SIGOPS symposium on Principles of distributed computing. New York, NY, USA, pp. 108\u2013117 (2005)","DOI":"10.1145\/1073814.1073834"},{"key":"9069_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? In: STOC \u201993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 184\u2013193. New York, NY, USA, (1993)","DOI":"10.1145\/167088.167149"},{"key":"9069_CR26","doi-asserted-by":"crossref","unstructured":"Page, C.: Astrogrid and data mining. In: Starck, J.-L., Murtagh, F.D. (eds.) Proc. SPIE Vol. 4477, pp. 53\u201360, Astronomical Data Analysis, pp. 53\u201360 (2001)","DOI":"10.1117\/12.447188"},{"key":"9069_CR27","doi-asserted-by":"crossref","unstructured":"Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In: ICDM 03: Proceedings of the Third IEEE International Conference on Data Mining. Washington, DC, USA, pp. 363 (2003)","DOI":"10.1109\/ICDM.2003.1250941"},{"issue":"6","key":"9069_CR28","doi-asserted-by":"crossref","first-page":"2426","DOI":"10.1109\/TSMCB.2004.836888","volume":"34","author":"R. Wolff","year":"2004","unstructured":"Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. IEEE Trans. Syst. Man Cybern., Part B 34(6), 2426\u20132438 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern., Part B"}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-007-9069-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10723-007-9069-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-007-9069-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T21:57:09Z","timestamp":1736978229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10723-007-9069-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,25]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,4]]}},"alternative-id":["9069"],"URL":"https:\/\/doi.org\/10.1007\/s10723-007-9069-5","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"type":"print","value":"1570-7873"},{"type":"electronic","value":"1572-9184"}],"subject":[],"published":{"date-parts":[[2007,4,25]]}}}