{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:42Z","timestamp":1760440722341},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T00:00:00Z","timestamp":1196208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00453-007-9125-3","type":"journal-article","created":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T17:16:30Z","timestamp":1196183790000},"page":"318-336","source":"Crossref","is-referenced-by-count":21,"title":["Minimum-Cost Load-Balancing Partitions"],"prefix":"10.1007","volume":"54","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,28]]},"reference":[{"key":"9125_CR1","doi-asserted-by":"crossref","unstructured":"Aronov, B., Carmi, P., Katz, M.J.: Minimum-cost load-balancing partitions. In: Proc. 22nd ACM Symp. on Computational Geometry, pp. 301\u2013308, 2006","DOI":"10.1145\/1137856.1137901"},{"issue":"4","key":"9125_CR2","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"9125_CR3","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9125_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/PL00009187","volume":"20","author":"F. Aurenhammer","year":"1998","unstructured":"Aurenhammer, F., Hoffmann, F., Aronov, B.: Minkowski-type theorems and least-squares clustering. Algorithmica 20(1), 61\u201376 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"9125_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. Berg de","year":"2002","unstructured":"de Berg, M., Katz, M.J., van der Stappen, A.F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34(1), 81\u201397 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"9125_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00453-004-1130-1","volume":"41","author":"P. Carmi","year":"2005","unstructured":"Carmi, P., Dolev, S., Har-Peled, S., Katz, M.J., Segal, M.: Geographic quorum system approximations. Algorithmica 41(4), 233\u2013244 (2005)","journal-title":"Algorithmica"},{"issue":"3","key":"9125_CR7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.comgeo.2005.01.002","volume":"32","author":"P. Carmi","year":"2005","unstructured":"Carmi, P., Har-Peled, S., Katz, M.J.: On the Fermat-Weber center of a convex object. Comput. Geom. Theory Appl. 32(3), 188\u2013195 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9125_CR8","unstructured":"Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities, In: Proc. 16th ACM-SIAM Symp. Discrete Algorithms, pp. 952\u2013958, 2005"},{"issue":"1","key":"9125_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.1040.0137","volume":"53","author":"S.P. Fekete","year":"2005","unstructured":"Fekete, S.P., Mitchell, J.S.B., Beurer, K.: On the continuous Fermat-Weber problem. Oper. Res. 53(1), 61\u201376 (2005)","journal-title":"Oper. Res."},{"key":"9125_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"9125_CR11","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New York (2001)","edition":"2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9125-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9125-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9125-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9125-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,28]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9125"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9125-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,28]]}}}