Multiply Balanced k -Partitioning
Multiply Balanced k -Partitioning
复制标题
乘法平衡 k 划分
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Oren Sar Shalom
中科院分区：
文献类型：
--
作者：
A. Amir;Jessica Ficler;Robert Krauthgamer;L. Roditty;Oren Sar Shalom
已经充分研究了将n个顶点分配到k平衡部分的边缘电容图的问题。我们提出了一个新的问题，即在分布式系统中的负载平衡和社交网络中的市场细分诸如诸如负载平衡之类的应用程序，称为多重平衡的K分区，在该问题中，在D Vertex-weight功能下必须平衡顶点分区。
The problem of partitioning an edge-capacitated graph on n vertices into k balanced parts has been amply researched. Motivated by applications such as load balancing in distributed systems and market segmentation in social networks, we propose a new variant of the problem, called Multiply Balanced k Partitioning, where the vertex-partition must be balanced under d vertex-weight functions simultaneously.