pith. sign in

arxiv: 0812.5101 · v1 · pith:H2DA55GMnew · submitted 2008-12-30 · 💻 cs.GT · cs.DM· cs.DS

A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

classification 💻 cs.GT cs.DMcs.DS
keywords algorithmapproximationmaximumproblemsalesmantravelinggive
0
0 comments X
read the original abstract

We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.