Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
SIAM Journal on Computing
On the Continuous Fermat-Weber Problem
Operations Research
Approximating k-median with non-uniform capacities
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the Fermat--Weber center of a convex object
Computational Geometry: Theory and Applications
Equal-Area Locus-Based Convex Polygon Decomposition
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved bounds on the average distance to the Fermat--Weber center of a convex object
Information Processing Letters
Equal-area locus-based convex polygon decomposition
Theoretical Computer Science
| Hi-index | 0.00 |
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 Ri 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.