Approximation Algorithms for Some Optimum Communication Spanning Tree Problems

15 years 10 months ago

Download www.csie.ntu.edu.tw

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

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Real-time Traffic

Algorithms | Communication Spanning Tree | Cost Spanning Tree | ISAAC 1998 | Spanning Tree |

claim paper

» Some Structural and Geometric Properties of TwoConnected Steiner Networks

» The K kCapacitated Spanning Tree Problem

» The Directed MinimumDegree Spanning Tree Problem

» Construction of a ProxyBased Overlay Skeleton Tree for LargeScale RealTime Group Communica...

» ConstraintBased Local Search for Constrained Optimum Paths Problems

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» Local solutions for global problems in wireless networks

» Broadcasting in n kArrangement Graph Based on an Optimal Spanning Tree

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	ISAAC
Authors	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Comments (0)

Sciweavers

Approximation Algorithms for Some Optimum Communication Spanning Tree Problems

Algorithms | Communication Spanning Tree | Cost Spanning Tree | ISAAC 1998 | Spanning Tree |

Explore & Download

Productivity Tools

Sciweavers