Light graphs with small routing cost
Light graphs with small routing cost
复制标题
具有较小路由成本的光图
作者：
B. Wu;K. Chao;C. Tang
设\(G = (\{1, \ldots, n\}, E, w)\)是一个具有非负边权重\(w\)的无向图，并且设\(a_{ij}\)是顶点\(i\)和\(j\)之间的非负需求。对于\(G\)的任何生成子图\(H\)，\(H\)的权重是其边的总权重，并且\(H\)的路由成本是\(\sum_{i}\)（最后这里似乎不完整）
Let G = ({1,…, n}, E, w) be an undirected graph with nonnegative edge weights w and let aij be the nonnegative requirement between vertices i and j. For any spanning subgraph H of G, the weight of H is the total weight of its edges and the routing cost of H is Σi