MFCS   2001 International Symposium on Mathematical Foundations of Computer
Wall of Fame | Most Viewed MFCS-2001 Paper
13 years 12 months ago
On the Approximability of the Steiner Tree Problem
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
Martin Thimm
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 source130
2Download preprint from source121
3Download preprint from source114
4Download preprint from source112
5Download preprint from source99
6Download preprint from source95
7Download preprint from source90
8Download preprint from source84
9Download preprint from source79
10Download preprint from source78
11Download preprint from source78
12Download preprint from source77
13Download preprint from source71
14Download preprint from source69
15Download preprint from source54