Sciweavers

Share
ESA   2003 European Symposium on Algorithms
Wall of Fame | Most Viewed ESA-2003 Paper
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
9 years 18 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
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.
IdReadViewsTitleStatus
1Download preprint from source189
2Download preprint from source141
3Download preprint from source140
4Download preprint from source124
5Download preprint from source123
6Download preprint from source118
7Download preprint from source117
8Download preprint from source116
9Download preprint from source111
10Download preprint from source110
11Download preprint from source107
12Download preprint from source106
13Download preprint from source100
14Download preprint from source100
15Download preprint from source99
16Download preprint from source99
17Download preprint from source98
18Download preprint from source98
19Download preprint from source97
20Download preprint from source96
21Download preprint from source95
22Download preprint from source94
23Download preprint from source93
24Download preprint from source93
25Download preprint from source90
26Download preprint from source85
27Download preprint from source81
28Download preprint from source79
29Download preprint from source77
30Download preprint from source58
books