{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:46Z","timestamp":1750308046657,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,5]],"date-time":"2006-06-05T00:00:00Z","timestamp":1149465600000},"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":[[2006,6,5]]},"DOI":"10.1145\/1137856.1137901","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"301-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Minimum-cost load-balancing partitions"],"prefix":"10.1145","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[{"name":"Polytechnic University, Brooklyn, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[{"name":"University of the Negev, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[{"name":"University of the Negev, Beer-Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795295936"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/299917.299918"},{"key":"e_1_3_2_1_3_1","volume-title":"Minkowski-type theorems and least-squares clustering. Algorithmica, 20(1)","author":"Aurenhammer F.","year":"1998","unstructured":"F. Aurenhammer , F. Hoffmann , and B. Aronov . Minkowski-type theorems and least-squares clustering. Algorithmica, 20(1) ( 1998 ), 61--76. F. Aurenhammer, F. Hoffmann, and B. Aronov. Minkowski-type theorems and least-squares clustering. Algorithmica, 20(1) (1998), 61--76."},{"key":"e_1_3_2_1_4_1","volume-title":"Realistic input models for geometric algorithms. Algorithmica, 34(1)","author":"de Berg M.","year":"2002","unstructured":"M. de Berg , M.J. Katz , A.F. van der Stappen , and J. Vleugels . Realistic input models for geometric algorithms. Algorithmica, 34(1) ( 2002 ), 81--97. M. de Berg, M.J. Katz, A.F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Algorithmica, 34(1) (2002), 81--97."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1130-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.01.002"},{"key":"e_1_3_2_1_8_1","first-page":"952","volume-title":"Proc. 16th ACM-SIAM Symp. Discrete Algorithms","author":"Chuzhoy J.","year":"2005","unstructured":"J. Chuzhoy and Y. Rabani . Approximating k-Median with Non-Uniform Capacities . Proc. 16th ACM-SIAM Symp. Discrete Algorithms , pages 952 -- 958 , 2005 . J. Chuzhoy and Y. Rabani. Approximating k-Median with Non-Uniform Capacities. Proc. 16th ACM-SIAM Symp. Discrete Algorithms, pages 952--958, 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0137"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_11_1","volume-title":"Introduction to Graph Theory","author":"West D.B.","year":"2001","unstructured":"D.B. West . Introduction to Graph Theory . Second edition, Prentice Hall , 2001 . D.B. West. Introduction to Graph Theory. Second edition, Prentice Hall, 2001."}],"event":{"name":"SoCG06: 22nd Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Sedona Arizona USA","acronym":"SoCG06"},"container-title":["Proceedings of the twenty-second annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1137856.1137901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:32Z","timestamp":1750259672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,5]]},"references-count":10,"alternative-id":["10.1145\/1137856.1137901","10.1145\/1137856"],"URL":"https:\/\/doi.org\/10.1145\/1137856.1137901","relation":{},"subject":[],"published":{"date-parts":[[2006,6,5]]},"assertion":[{"value":"2006-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}