Wall of Fame | Most Viewed ALGORITHMICA-2004 Paper
153views more  ALGORITHMICA 2004»
13 years 5 months ago
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
Jochen Könemann, Asaf Levin, Amitabh Sinha
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 source153
2Download preprint from source150
3Download preprint from source132
4Download preprint from source130
5Download preprint from source130
6Download preprint from source125
7Download preprint from source112
8Download preprint from source111
9Download preprint from source111
10Download preprint from source111
11Download preprint from source103
12Download preprint from source96
13Download preprint from source88
14Download preprint from source84
15Download preprint from source74
16Download preprint from source65
17Download preprint from source65
18Download preprint from source61
19Download preprint from source55