TY - GEN

T1 - Minimum-cost load-balancing partitions

AU - Aronov, Boris

AU - Carmi, Paz

AU - Katz, Matthew J.

PY - 2006

Y1 - 2006

N2 - 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 p1,... ,pm be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R1.,..., Rm, so that region R i is served by facility pi, 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 = 2k equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. We also 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.

AB - 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 p1,... ,pm be m points representing m facilities. We consider the following problem: Subdivide D into m equal-area regions R1.,..., Rm, so that region R i is served by facility pi, 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 = 2k equal-area convex subregions so that the fatness of the resulting regions is within a constant factor of the fatness of the original polygon. We also 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.

KW - Additive-weighted Voronoi diagrams

KW - Approximation algorithms

KW - Fat partitions

KW - Fatness

KW - Geometric optimization

KW - Load balancing

UR - http://www.scopus.com/inward/record.url?scp=33748051075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748051075&partnerID=8YFLogxK

U2 - 10.1145/1137856.1137901

DO - 10.1145/1137856.1137901

M3 - Conference contribution

AN - SCOPUS:33748051075

SN - 1595933409

SN - 9781595933409

T3 - Proceedings of the Annual Symposium on Computational Geometry

SP - 301

EP - 308

BT - Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06

PB - Association for Computing Machinery (ACM)

T2 - 22nd Annual Symposium on Computational Geometry 2006, SCG'06

Y2 - 5 June 2006 through 7 June 2006

ER -