A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
✍ Scribed by Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 155 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, the routing requirement of a pair of vertices is assumed to be the product of their weights. The routing cost for a pair of vertices on a given spanning tree is defined as the length of the path between them multiplied by their routing requirement. The optimal product-requirement communication spanning tree is the spanning tree with minimum total routing cost summed over all pairs of vertices. This problem arises in network design and computational biology. For the special case that all vertex weights are identical, it has been shown that the problem is NP-hard and that there is a polynomial time approximation scheme for it. In this paper we show that the generalized problem also admits a polynomial time approximation scheme.