{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:37Z","timestamp":1725750577475},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_36","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"522-536","source":"Crossref","is-referenced-by-count":3,"title":["A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location"],"prefix":"10.1007","author":[{"given":"James","family":"Hegeman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram V.","family":"Pemmaraju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Berns, A., Hegeman, J., Pemmaraju, S.V.: Super-fast distributed algorithms for metric facility location. CoRR (archived on August 11, 2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1308.2473","key":"36_CR1"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-642-31585-5_39","volume-title":"Automata, Languages, and Programming","author":"A. Berns","year":"2012","unstructured":"Berns, A., Hegeman, J., Pemmaraju, S.V.: Super-fast distributed algorithms for metric facility location. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 428\u2013439. Springer, Heidelberg (2012)"},{"unstructured":"Frank, C.: Algorithms for Sensor and Ad Hoc Networks. Springer (2007)","key":"36_CR3"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/1148109.1148152","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2006","author":"J. Gehweiler","year":"2006","unstructured":"Gehweiler, J., Lammersen, C., Sohler, C.: A distributed O(1)-approximation algorithm for the uniform facility location problem. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2006, pp. 237\u2013243. ACM Press, New York (2006)"},{"unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 649\u2013657. Society for Industrial and Applied Mathematics (1998), \n                    \n                      http:\/\/arxiv.org\/abs\/1308.2473","key":"36_CR5"},{"doi-asserted-by":"crossref","unstructured":"Hegeman, J., Pemmaraju, S.V.: A super-fast distributed algorithm for bipartite metric facility location. CoRR (archived on August 12, 2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1308.2694","key":"36_CR6","DOI":"10.1007\/978-3-642-41527-2_36"},{"doi-asserted-by":"crossref","unstructured":"Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. CoRR, abs\/1207.1852 (2012)","key":"36_CR7","DOI":"10.1145\/2484239.2501983"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-22012-8_5","volume-title":"Automata, Languages and Programming","author":"S. Li","year":"2011","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 77\u201388. Springer, Heidelberg (2011)"},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/S0097539704441848","volume":"35","author":"Z. Lotker","year":"2005","unstructured":"Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM J. Comput.\u00a035(1), 120\u2013131 (2005)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"36_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00446-005-0127-6","volume":"18","author":"Z. Lotker","year":"2006","unstructured":"Lotker, Z., Patt-Shamir, B., Peleg, D.: Distributed mst for constant diameter graphs. Distributed Computing\u00a018(6), 453\u2013460 (2006)","journal-title":"Distributed Computing"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"R.R. Mettu","year":"2003","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput.\u00a032(3), 816\u2013832 (2003)","journal-title":"SIAM J. Comput."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/1073814.1073834","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing","author":"T. Moscibroda","year":"2005","unstructured":"Moscibroda, T., Wattenhofer, R.: Facility location: distributed approximation. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 108\u2013117. ACM Press, New York (2005)"},{"doi-asserted-by":"crossref","unstructured":"Pandit, S., Pemmaraju, S.V.: Finding facilities fast. Distributed Computing and Networking, 11\u201324 (2009)","key":"36_CR13","DOI":"10.1007\/978-3-540-92295-7_5"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/1582716.1582747","volume-title":"Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009","author":"S. Pandit","year":"2009","unstructured":"Pandit, S., Pemmaraju, S.V.: Return of the primal-dual: distributed metric facility location. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 180\u2013189. ACM Press, New York (2009)"},{"doi-asserted-by":"crossref","unstructured":"Pandit, S., Pemmaraju, S.V.: Rapid randomized pruning for fast greedy distributed algorithms. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 325\u2013334. ACM (2010)","key":"36_CR15","DOI":"10.1145\/1835698.1835777"},{"doi-asserted-by":"crossref","unstructured":"Patt-Shamir, B., Teplitsky, M.: The round complexity of distributed sorting: extended abstract. In: PODC, pp. 249\u2013256. ACM Press (2011)","key":"36_CR16","DOI":"10.1145\/1993806.1993851"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:40:06Z","timestamp":1558118406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}