DAM   2000
Wall of Fame | Most Viewed DAM-2000 Paper
199views more  DAM 2000»
8 years 11 months ago
Approximation algorithms for the shortest total path length spanning tree problem
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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source199
2Download preprint from source137
3Download preprint from source126
4Download preprint from source121
5Download preprint from source101
6Download preprint from source97
7Download preprint from source89
8Download preprint from source86
9Download preprint from source84
10Download preprint from source83
11Download preprint from source78
12Download preprint from source78
13Download preprint from source76
14Download preprint from source75
15Download preprint from source69
16Download preprint from source68
17Download preprint from source67
18Download preprint from source63
19Download preprint from source62
20Download preprint from source61
21Download preprint from source59