带度约束的直径最小化捷径算法
Diameter Minimization by Shortcutting with Degree Constraints
摘要:
考虑在无向图中添加固定数目的新边以使扩充图的直径最小化的问题,并且在每个顶点添加的边数为整数的约束下.这个问题的动机是网络设计应用程序,我们希望在不过度增加任何单个顶点的程度的情况下,最大限度地减少网络中最坏情况下的通信,以避免额外的过载。我们提出了三种算法,每个都有自己的优点。匹配增强的特殊情况下,当每个顶点可以是事件至多一个新的边缘,是特别感兴趣的,为此,我们显示了一个不可逼近的结果,并提供边界上的最小可实现的直径时,这些边缘被添加到一个path.Finally,我们经验评估和比较我们的算法在现实生活中的几个不同类型的网络。
英文摘要:
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer. The problem is motivated by network-design applications, where we want to minimize the worst case communication in the network without excessively increasing the degree of any single vertex, so as to avoid additional overload. We present three algorithms for this task, each with their own merits. The special case of a matching augmentation, when every vertex can be incident to at most one new edge, is of particular interest, for which we show an inapproximability result, and provide bounds on the smallest achievable diameter when these edges are added to a path. Finally, we empirically evaluate and compare our algorithms on several real-life networks of varying types.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。