Sciweavers

COMPGEOM
2006
ACM

Minimum-cost load-balancing partitions

13 years 9 months ago
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.
Boris Aronov, Paz Carmi, Matthew J. Katz
Added 13 Jun 2010
Updated 13 Jun 2010
Type Conference
Year 2006
Where COMPGEOM
Authors Boris Aronov, Paz Carmi, Matthew J. Katz
Comments (0)