Abstract
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 language | English |
|---|---|
| Pages | 65-67 |
| Number of pages | 3 |
| State | Published - 1 Jan 2005 |
| Event | 17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada Duration: 10 Aug 2005 → 12 Aug 2005 |
Conference
| Conference | 17th Canadian Conference on Computational Geometry, CCCG 2005 |
|---|---|
| Country/Territory | Canada |
| City | Windsor |
| Period | 10/08/05 → 12/08/05 |
ASJC Scopus subject areas
- Geometry and Topology
- Computational Mathematics