OpenReview
.net
OpenReview
.net
Login
OpenReview
.net
Login
Go to
APPROX 2009
homepage
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Katarzyna E. Paluch
,
Marcin Mucha
,
Aleksander Madry
2009 (modified: 13 May 2020)
APPROX-RANDOM2009
Readers:
Everyone
Abstract:
We give a deterministic combinatorial 7/9-approximation algorithm for the symmetric maximum traveling salesman problem.
0 Replies
Loading