TY - GEN

T1 - Balancing graph Voronoi diagrams

AU - Honide, Shinichi

AU - Houle, Michael E.

AU - Sommer, Christian

PY - 2009

Y1 - 2009

N2 - Many facility location problems are concerned with minimizing operation and transportation costs by partitioning territory into regions of similar size, each of which is served by a facility. For many optimization problems, the overall cost can be reduced by means of a partitioning into balanced subsets, especially in those cases where the cost associated with a subset is superlinear in its size. In this paper, we consider the problem of generating a Voronoi partition of a discrete graph so as to achieve balance conditions on the region sizes. Through experimentation, we first establish that the region sizes of randomly-generated graph Voronoi diagrams vary greatly in practice.We then show how to achieve a balanced partition of a graph via Voronoi site resampling. For bounded-degree graphs, where each of the n nodes has degree at most d, and for an initial randomly-chosen set of s Voronoi nodes, we prove that, by extending the set of Voronoi nodes using an algorithm by Thorup and Zwick, each Voronoi region has size at most 4dn/s+1 nodes, and that the expected size of the extended set of Voronoi nodes is at most 2s log n.

AB - Many facility location problems are concerned with minimizing operation and transportation costs by partitioning territory into regions of similar size, each of which is served by a facility. For many optimization problems, the overall cost can be reduced by means of a partitioning into balanced subsets, especially in those cases where the cost associated with a subset is superlinear in its size. In this paper, we consider the problem of generating a Voronoi partition of a discrete graph so as to achieve balance conditions on the region sizes. Through experimentation, we first establish that the region sizes of randomly-generated graph Voronoi diagrams vary greatly in practice.We then show how to achieve a balanced partition of a graph via Voronoi site resampling. For bounded-degree graphs, where each of the n nodes has degree at most d, and for an initial randomly-chosen set of s Voronoi nodes, we prove that, by extending the set of Voronoi nodes using an algorithm by Thorup and Zwick, each Voronoi region has size at most 4dn/s+1 nodes, and that the expected size of the extended set of Voronoi nodes is at most 2s log n.

KW - Balancing

KW - Facility location

KW - Graph Voronoi diagram

KW - Territorial design

UR - http://www.scopus.com/inward/record.url?scp=77951472302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951472302&partnerID=8YFLogxK

U2 - 10.1109/ISVD.2009.26

DO - 10.1109/ISVD.2009.26

M3 - Conference contribution

AN - SCOPUS:77951472302

SN - 9780769537818

T3 - 6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009

SP - 183

EP - 191

BT - 6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009

T2 - 6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009

Y2 - 23 June 2009 through 26 June 2009

ER -