Minimal ratio spanning trees
暂无分享,去创建一个
Given an undirected graph G: (N;E) with a node set N and an edge set E and numbers Ce and De, e ϵ E, we provide a polynominally bounded algorithm to solve the problem: Find a spanning tree T such that the ratio
is minimized. An extension to finding bases in matroids that minimize such ratio functions is immediate. It is shown that an algorithm that is “greedy,” in the sense of Edmonds [2], will not work for this problem.
[1] R. Prim. Shortest connection networks and some generalizations , 1957 .
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..
[4] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[5] D. R. Fulkerson,et al. Flows in Networks. , 1964 .