Approximation Algorithms for Some Optimum Communication Spanning Tree Problems

Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning tree (PROCT) problem is to

• Type: Conference
• Year: 1998
• Where: ISAAC
• Authors: Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
• Keywords: Algorithms, Communication Spanning Tree, Cost Spanning Tree, ISAAC 1998, Spanning Tree