MFCS 2001 International Symposium on Mathematical Foundations of Computer
 |  |
Wall of Fame | Most Viewed MFCS-2001 Paper
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 130 | ||
| 2 | | 121 | ||
| 3 | | 114 | ||
| 4 | | 112 | ||
| 5 | | 99 | ||
| 6 | | 95 | ||
| 7 | | 90 | ||
| 8 | | 84 | ||
| 9 | | 79 | ||
| 10 | | 78 | ||
| 11 | | 78 | ||
| 12 | | 77 | ||
| 13 | | 71 | ||
| 14 | | 69 | ||
| 15 | | 54 |