Abstract
We consider the problem of balancing the load among several service-providing facilities, while keeping the total cost low. Let D be the underlying demand region, and let p 1,…,p m be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R 1,…,R m , so that region R i is served by facility p i , and the average distance between a point q in D and the facility that serves q is minimal.
We present constant-factor approximation algorithms for this problem, with the additional requirement that the resulting regions must be convex. As an intermediate result we show how to partition a convex polygon into m equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. In fact, we prove that our partition is, up to a constant factor, the best one can get if one’s goal is to maximize the fatness of the least fat subregion.
We also discuss the structure of the optimal partition for the aforementioned load balancing problem: indeed, we argue that it is always induced by an additive-weighted Voronoi diagram for an appropriate choice of weights.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aronov, B., Carmi, P., Katz, M.J.: Minimum-cost load-balancing partitions. In: Proc. 22nd ACM Symp. on Computational Geometry, pp. 301–308, 2006
Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412–458 (1998)
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–953 (1999)
Aurenhammer, F., Hoffmann, F., Aronov, B.: Minkowski-type theorems and least-squares clustering. Algorithmica 20(1), 61–76 (1998)
de Berg, M., Katz, M.J., van der Stappen, A.F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34(1), 81–97 (2002)
Carmi, P., Dolev, S., Har-Peled, S., Katz, M.J., Segal, M.: Geographic quorum system approximations. Algorithmica 41(4), 233–244 (2005)
Carmi, P., Har-Peled, S., Katz, M.J.: On the Fermat-Weber center of a convex object. Comput. Geom. Theory Appl. 32(3), 188–195 (2005)
Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities, In: Proc. 16th ACM-SIAM Symp. Discrete Algorithms, pp. 952–958, 2005
Fekete, S.P., Mitchell, J.S.B., Beurer, K.: On the continuous Fermat-Weber problem. Oper. Res. 53(1), 61–76 (2005)
Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New York (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
An earlier version of this paper appeared in the Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, pp. 301–308, 2006.
B. Aronov’s research supported in part by NSF grant ITR-0081964 and by a grant from the US-Israel Binational Science Foundation.
P. Carmi partially supported by the Lynn and William Frankel Center for Computer Sciences.
M.J. Katz partially supported by grant no. 2000160 from the US-Israel Binational Science Foundation.
Rights and permissions
About this article
Cite this article
Aronov, B., Carmi, P. & Katz, M.J. Minimum-Cost Load-Balancing Partitions. Algorithmica 54, 318–336 (2009). https://doi.org/10.1007/s00453-007-9125-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9125-3