Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
427864 | Information Processing Letters | 2009 | 5 Pages |
Abstract
We show that for any convex object Q in the plane, the average distance between the Fermat–Weber center of Q and the points in Q is at least 4Δ(Q)/25, and at most , where Δ(Q) is the diameter of Q. We use the former bound to improve the approximation ratio of a load-balancing algorithm of Aronov et al. [B. Aronov, P. Carmi, M.J. Katz, Minimum-cost load-balancing partitions, Algorithmica, in press].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics