{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T03:48:30Z","timestamp":1777175310037,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810479.1810535","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Parallel approximation algorithms for facility-location problems"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63455"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398594"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-69346-7_14","volume-title":"Integer programming and combinatorial optimization (IPCO)","author":"Chudak F. A.","year":"1998","unstructured":"F. A. Chudak . Improved approximation algorithms for uncapacitated facility location . In Integer programming and combinatorial optimization (IPCO) , volume 1412 of Lecture Notes in Comput . Sci., pages 180 -- 194 . Springer , Berlin, 1998 . F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. In Integer programming and combinatorial optimization (IPCO), volume 1412 of Lecture Notes in Comput. Sci., pages 180--194. Springer, Berlin, 1998."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703405754"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054916.1054931"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148152"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0993"},{"key":"e_1_3_2_1_14_1","volume-title":"Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554","author":"Gupta A.","year":"2008","unstructured":"A. Gupta and K. Tangwongsan . Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554 , 2008 . A. Gupta and K. Tangwongsan. Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5933"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950621"},{"key":"e_1_3_2_1_19_1","volume-title":"An Introduction to Parallel Algorithms","author":"J\u00e1 J. J\u00e1","year":"1992","unstructured":"J. J\u00e1 J\u00e1 . An Introduction to Parallel Algorithms . Addison-Wesley , 1992 . ISBN 0-201-54856-9. J. J\u00e1 J\u00e1. An Introduction to Parallel Algorithms. Addison-Wesley, 1992. ISBN 0-201-54856-9."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1036"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1100"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582746"},{"key":"e_1_3_2_1_24_1","volume-title":"Trees, Hypercubes","author":"Leighton F. T.","year":"1992","unstructured":"F. T. Leighton . Introduction to Parallel Algorithms and Architectures: Array , Trees, Hypercubes . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 1992 . ISBN 1-55860-117-1. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1992. ISBN 1-55860-117-1."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167211"},{"key":"e_1_3_2_1_27_1","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-44666-4_16","volume-title":"Approximation, randomization, and combinatorial optimization (Berkeley","author":"Mahdian M.","year":"2001","unstructured":"M. Mahdian , E. Markakis , A. Saberi , and V. Vazirani . A greedy facility location algorithm analyzed using dual fitting . In Approximation, randomization, and combinatorial optimization (Berkeley , CA, 2001 ), volume 2129 of Lecture Notes in Comput . Sci., pages 127 -- 137 . Springer , Berlin, 2001. M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Approximation, randomization, and combinatorial optimization (Berkeley, CA, 2001), volume 2129 of Lecture Notes in Comput. Sci., pages 127--137. Springer, Berlin, 2001."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646689.703120"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073834"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_31_1","first-page":"584","volume-title":"FOCS'03","author":"P\u00e1l M.","year":"2003","unstructured":"M. P\u00e1l and \u00c9. Tardos. Group strategyproof mechanisms via primal-dual algorithms . In FOCS'03 , pages 584 -- 593 , 2003 . M. P\u00e1l and \u00c9. Tardos. Group strategyproof mechanisms via primal-dual algorithms. In FOCS'03, pages 584--593, 2003."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582747"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793260763"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"key":"e_1_3_2_1_35_1","first-page":"567","volume-title":"SODA","author":"Srinivasan A.","year":"2001","unstructured":"A. Srinivasan . New approaches to covering and packing problems . In SODA , pages 567 -- 576 , 2001 . A. Srinivasan. New approaches to covering and packing problems. In SODA, pages 567--576, 2001."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645591.659950"},{"key":"e_1_3_2_1_37_1","first-page":"254","volume-title":"Proc. IEEE Symposium on Parallel and Distributed Processing","author":"Wang Q.","year":"1990","unstructured":"Q. Wang and K. H. Cheng . Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights . In Proc. IEEE Symposium on Parallel and Distributed Processing , pages 254 -- 257 , Dec. 1990 . Q. Wang and K. H. Cheng. Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights. In Proc. IEEE Symposium on Parallel and Distributed Processing, pages 254 --257, Dec. 1990."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875556"}],"event":{"name":"SPAA 10: 22nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Thira Santorini Greece","acronym":"SPAA 10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810479.1810535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:23Z","timestamp":1750245803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":38,"alternative-id":["10.1145\/1810479.1810535","10.1145\/1810479"],"URL":"https:\/\/doi.org\/10.1145\/1810479.1810535","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}