๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi

Book ID
118178225
Publisher
Society for Industrial and Applied Mathematics
Year
2000
Tongue
English
Weight
409 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
โœ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 155 KB

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 mult