WADS   2005 Workshop on Algorithms and Data Structures
Wall of Fame | Most Viewed WADS-2005 Paper
187views Algorithms» more  WADS 2005»
13 years 8 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
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 source187
2Download preprint from source162
3Download preprint from source149
4Download preprint from source145
5Download preprint from source133
6Download preprint from source132
7Download preprint from source132
8Download preprint from source122
9Download preprint from source122
10Download preprint from source114
11Download preprint from source114
12Download preprint from source114
13Download preprint from source111
14Download preprint from source111
15Download preprint from source108
16Download preprint from source96
17Download preprint from source95
18Download preprint from source95
19Download preprint from source88
20Download preprint from source78
21Download preprint from source69
22Download preprint from source57