乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:31Z","timestamp":1730328991092,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780548","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T13:18:43Z","timestamp":1082380723000},"page":"30-39","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":108,"title":["Better streaming algorithms for clustering problems"],"prefix":"10.1145","author":[{"given":"Moses","family":"Charikar","sequence":"first","affiliation":[{"name":"Princeton University"}]},{"given":"Liadan","family":"O'Callaghan","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[{"name":"Cisco Systems"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509964"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796550"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276718"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380755"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. SODA","author":"Bar-Yossef Z.","year":"2002","unstructured":"Z. Bar-Yossef , S. R. Kumar , and D. Sivakumar . Reductions in streaming algorithms, with an application to counting triangles in graphs . Proc. SODA , 2002 .]] Z. Bar-Yossef, S. R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. Proc. SODA, 2002.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258657"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796483"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301257"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. SODA","author":"Charikar M.","year":"2001","unstructured":"M. Charikar , S. Khuller , D. M. Mount , and G. Narasimhan . Algorithms for facility location problems with outliers . Proc. SODA 2001 .]] M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. Proc. SODA 2001.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380753"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(85)90002-1","article-title":"A simple heuristic for the p--center problem","volume":"3","author":"Dyer M.","year":"1985","unstructured":"M. Dyer and A. M. Frieze . A simple heuristic for the p--center problem . Operations Research Letters , v. 3 , 1985 .]] M. Dyer and A. M. Frieze. A simple heuristic for the p--center problem. Operations Research Letters, v. 3, 1985.]]","journal-title":"Operations Research Letters"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. FOCS","author":"Feigenbaum J.","year":"2000","unstructured":"J. Feigenbaum , S. Kannan , M. Strauss , and M. Viswanathan . An approximate L1-difference algorithm for massive data streams . Proc. FOCS , 2000 .]] J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. Proc. FOCS, 2000.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509966"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380841"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796588"},{"key":"e_1_3_2_1_17_1","article-title":"An algorithmic approach to network location problems, part ii: p-medians","volume":"37","author":"Kariv O.","year":"1979","unstructured":"O. Kariv and S. L. Hakimi . An algorithmic approach to network location problems, part ii: p-medians . SIAM Journal of Appl. Math , v. 37 , 1979 .]] O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems, part ii: p-medians. SIAM Journal of Appl. Math, v. 37, 1979.]]","journal-title":"SIAM Journal of Appl. Math"},{"key":"e_1_3_2_1_18_1","volume-title":"DIMACS series in Discrete Mathematics and Theoretical Computer Science, v. 50","author":"Henzinger M.","year":"1999","unstructured":"M. Henzinger , P. Raghavan , and S. Rajagopalan . Computing on data streams . In DIMACS series in Discrete Mathematics and Theoretical Computer Science, v. 50 , 1999 .]] M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In DIMACS series in Discrete Mathematics and Theoretical Computer Science, v. 50, 1999.]]"},{"key":"e_1_3_2_1_19_1","volume-title":"A best possible approximation algorithm for the k--Center problem. Mathematics of Operations Research, v. 10","author":"Hochbaum D. S.","year":"1985","unstructured":"D. S. Hochbaum and D. B. Shmoys . A best possible approximation algorithm for the k--Center problem. Mathematics of Operations Research, v. 10 , 1985 .]] D. S. Hochbaum and D. B. Shmoys. A best possible approximation algorithm for the k--Center problem. Mathematics of Operations Research, v. 10, 1985.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301366"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796533"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. FOCS","author":"Indyk P.","year":"2000","unstructured":"P. Indyk . Stable distributions, pseudorandom generators , embeddings and data stream computation . Proc. FOCS , 2000 .]] P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proc. FOCS, 2000.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. SODA","author":"Korupolu M.","year":"1998","unstructured":"M. Korupolu , C. G. Plaxton , and R. Rajaraman . Analysis of a local search heuristic for facility location problems . Proc. SODA , 1998 .]] M. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Proc. SODA, 1998.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90208-D"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129787"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304204"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796586"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. UAI","author":"Mettu R.","year":"2002","unstructured":"R. Mettu and C. G. Plaxton . Optimal time bounds for approximate clustering . Proc. UAI , 2002 .]] R. Mettu and C. G. Plaxton. Optimal time bounds for approximate clustering. Proc. UAI, 2002.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875567"},{"key":"e_1_3_2_1_31_1","volume-title":"Approximating k--Median: A sampling-based approach. Unpublished manuscript","author":"Meyerson A.","year":"2001","unstructured":"A. Meyerson , L. O'Callaghan and S. Plotkin . Approximating k--Median: A sampling-based approach. Unpublished manuscript , 2001 .]] A. Meyerson, L. O'Callaghan and S. Plotkin. Approximating k--Median: A sampling-based approach. Unpublished manuscript, 2001.]]"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. SODA","author":"Mishra N.","year":"2001","unstructured":"N. Mishra , D. Oblinger and L. Pitt . Sublinear time approximate clustering . Proc. SODA , 2001 .]] N. Mishra, D. Oblinger and L. Pitt. Sublinear time approximate clustering. Proc. SODA, 2001.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684103"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. SODA","author":"Young N. E.","year":"2000","unstructured":"N. E. Young . K-medians, facility location, and the Chernoff-Wald bound. In Proc. SODA , 2000 .]] N. E. Young. K-medians, facility location, and the Chernoff-Wald bound. In Proc. SODA, 2000.]]"}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:31:47Z","timestamp":1672965107000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":34,"alternative-id":["10.1145\/780542.780548","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780548","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}