Name
Title | ||
|---|---|---|
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object |
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 2¢(Q)=(3 p 3), 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. (1). |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ipl.2008.11.009 | Canadian Conference on Computational Geometry |
Keywords | Field | DocType |
minimum-cost load-balancing partition,load-balancing algorithm,approximation ratio,convex object,p. carmi,fermat-weber center,improved bound,b. aronov,m.j. katz,average distance,load balance | Discrete mathematics,Combinatorics,Regular polygon,Fermat's Last Theorem,Mathematics | Journal |
Volume | Issue | ISSN |
109 | 6 | 0020-0190 |
Citations | PageRank | References |
2 | 0.44 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Karim Abu-Affash | 1 | 37 | 7.94 |
| Matthew J. Katz | 2 | 225 | 19.92 |