Minimum-cost load-balancing partitions

We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm be m points representing m facilities. We consider the following problem. Divide R into m subregions R1, . . . , Rm, each of area area(R)/m, such that region Ri is served by facility pi, and the average distance between a point q in R and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem.

• Type: Conference
• Year: 2006
• Where: COMPGEOM
• Authors: Boris Aronov, Paz Carmi, Matthew J. Katz
• Keywords: COMPGEOM 2006, Demand Region, Service-providing Facilities, Total Cost