Approximation Algorithms for the Minimum Routing Cost Spanning Tree Problem and Its Generalizations
博士 === 國立清華大學 === 資訊工程學系 === 87 === For an undirected graph with nonnegative costs on the edges, the routing cost of a pair of vertices is the cost of the shortest path between the pair, and the routing cost of any of its spanning trees is the sum over all pairs of vertices of the routing...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91315431345714740105 |