Approximation algorithms for the shortest total path length spanning tree problem

14 years 8 days ago

Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to

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

Approximation Ratio | DAM 2000 | Shortest Total Path | Total Path Length |

claim paper

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DAM
Authors	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Comments (0)