Minimum-cost load-balancing partitions

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations


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 sub- regions R1, Rm, each of area area(R)/m, such that region Ri is served by facility pi, and the average dis- tance between a point q in R and the facility that serves q is minimal. We present constant-factor approximation algorithms for this problem.

Original languageEnglish
Number of pages3
StatePublished - 1 Jan 2005
Event17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada
Duration: 10 Aug 200512 Aug 2005


Conference17th Canadian Conference on Computational Geometry, CCCG 2005

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'Minimum-cost load-balancing partitions'. Together they form a unique fingerprint.

Cite this